Principles of Parallel ProgrammingPearson/Addison Wesley, 2008 - 338 pagina's With the rise of multi-core architecture, parallel programming is an increasingly important topic for software engineers and computer system designers. Written by well-known researchers Larry Snyder and Calvin Lin, this highly anticipated first edition emphasises the principles underlying parallel computation, explains the various phenomena, and clarifies why these phenomena represent opportunities or barriers to successful parallel programming. Ideal for an advanced upper-level undergraduate course, Principles of Parallel Programming supplies enduring knowledge that will outlive the current hardware and software, aiming to inspire future researchers to build tomorrow's solutions. |
Vanuit het boek
48 pagina's komen overeen met synchronization in dit boek
Pagina 335
Resultaten 1-3 van 48
Inhoudsopgave
Contents | 1 |
Convenience of Parallel Abstractions | 8 |
8893 | 30 |
Copyright | |
6 andere gedeelten niet getoond
Overige edities - Alles bekijken
Principles of Parallel Programming Larry Snyder,Yun Calvin Lin,Lawrence Snyder Geen voorbeeld beschikbaar - 2009 |
Veelvoorkomende woorden en zinsdelen
&lock address space algorithm allocation Amdahl's Law approach assigned atomic barrier block buffer Cell processor Chapter Co-Array Fortran Code Spec column compiler complete concurrency condition variable core count critical section data structures define dependences dimension distributed elements example execution false sharing flood function global view GPUs granularity grid hardware implement interactions interface iteration Java latency lock loop machine MapReduce matrix matrix multiplication message passing MPI program MPI_COMM_WORLD multi-core chips multiple mutex NESL number of processors number of threads OpenMP operand overhead P-independent parallel computation parallel programming performance model Peril-L POSIX Threads pragma problem programming language pthread_mutex_unlock race conditions rank reduce and scan region result Return value root process routine sequence sequential program shared memory shown in Figure single solution specified speedup statement successive over-relaxation synchronization tion transactional memory tree Unified Parallel view abstractions void wait write ZPL's