Evolving OpenMP in an Age of Extreme Parallelism
5th International Workshop on OpenMP, IWOMP 2009, Dresden, Germany, June 3-5, 2009 Proceedings
Series: Lecture Notes in Computer Science; 5568;
- Publisher's listprice EUR 53.49
-
22 690 Ft (21 609 Ft + 5% VAT)
The price is estimated because at the time of ordering we do not know what conversion rates will apply to HUF / product currency when the book arrives. In case HUF is weaker, the price increases slightly, in case HUF is stronger, the price goes lower slightly.
- Discount 8% (cc. 1 815 Ft off)
- Discounted price 20 874 Ft (19 880 Ft + 5% VAT)
22 690 Ft
Availability
Estimated delivery time: In stock at the publisher, but not at Prospero's office. Delivery time approx. 3-5 weeks.
Not in stock at Prospero.
Why don't you give exact delivery time?
Delivery time is estimated on our previous experiences. We give estimations only, because we order from outside Hungary, and the delivery time mainly depends on how quickly the publisher supplies the book. Faster or slower deliveries both happen, but we do our best to supply as quickly as possible.
Product details:
- Edition number 2009
- Publisher Springer
- Date of Publication 25 May 2009
- Number of Volumes 1 pieces, Book
- ISBN 9783642022845
- Binding Paperback
- No. of pages183 pages
- Size 235x155 mm
- Weight 454 g
- Language English
- Illustrations X, 183 p. 0
Categories
Long description:
OpenMP is an application programming interface (API) that is widely accepted as a de facto standard for high-level shared-memory parallel programming. It is a portable, scalable programming model that provides a simple and ?exible interface for developing shared-memory parallel applications in Fortran, C, and C++. Since its introduction in 1997, OpenMP has gained support from the - jority of high-performance compiler and hardware vendors. Under the direction of the OpenMP Architecture Review Board (ARB), the OpenMP speci?cation is undergoing further improvement. Active research in OpenMP compilers, r- time systems, tools, and environments continues to drive OpenMP evolution.To provideaforumforthedisseminationandexchangeofinformationaboutand- periences with OpenMP, the community of OpenMP researchersand developers in academia and industry is organized under cOMPunity (www.compunity.org). This organization has held workshops on OpenMP since 1999. This book contains the proceedings of the 5th International Workshop on OpenMP held in Dresden in June 2009. With sessions on tools, benchmarks, applications, performance and runtime environments it covered all aspects of the current use of OpenMP. In addition, several contributions presented p- posed extensions to OpenMP and evaluated reference implementations of those extensions. An invited talk provided the details on the latest speci?cation dev- opment inside the Architecture Review Board. Together with the two keynotes about OpenMP on hardware accelerators and future generation processors it demonstrated that OpenMP is suitable for future generation systems.
MoreTable of Contents:
Fifth International Workshop on OpenMP IWOMP 2009.- Parallel Simulation of Bevel Gear Cutting Processes with OpenMP Tasks.- Evaluation of Multicore Processors for Embedded Systems by Parallel Benchmark Program Using OpenMP.- Extending Automatic Parallelization to Optimize High-Level Abstractions for Multicore.- Scalability Evaluation of Barrier Algorithms for OpenMP.- Use of Cluster OpenMP with the Gaussian Quantum Chemistry Code: A Preliminary Performance Analysis.- Evaluating OpenMP 3.0 Run Time Systems on Unbalanced Task Graphs.- Dynamic Task and Data Placement over NUMA Architectures: An OpenMP Runtime Perspective.- Scalability of Gaussian 03 on SGI Altix: The Importance of Data Locality on CC-NUMA Architecture.- Providing Observability for OpenMP 3.0 Applications.- A Microbenchmark Suite for Mixed-Mode OpenMP/MPI.- Performance Profiling for OpenMP Tasks.- Tile Reduction: The First Step towards Tile Aware Parallelization in OpenMP.- A Proposal to Extend the OpenMP Tasking Model for Heterogeneous Architectures.- Identifying Inter-task Communication in Shared Memory Programming Models.
More
