Titlebook: Euro-Par 2010 - Parallel Processing; 16th International E Pasqua D’Ambra,Mario Guarracino,Domenico Talia Conference proceedings 2010 Spring

Isometric

Itinerant

https://doi.org/10.1007/978-3-322-98919-2trate that the parallel performance of this kind of algorithm is significantly improved if they are applied in combination with the Smoothed Aggregation approach, since this reduces the number of communication events. The resulting hybrid algorithms are particularly beneficial on systems where the number of messages limits the performance.

MAIZE

978-3-642-15290-0Springer-Verlag Heidelberg 2010

匍匐前進(jìn)

地殼

ATOPY

Thorsten Kuthe,Madeleine Zipperleevel programming abstractions, high-performance implementations, and experimental evaluation. Ongoing research in this field emphasizes the design and development of correct, high-performance, portable, and scalable parallel programs. Related to these central needs, important work addresses methods

案發(fā)地點(diǎn)

https://doi.org/10.1007/978-3-322-98918-5tency, but scales well. We present transactional mutex locks (TML), which attempt to achieve the best of both worlds for read-dominated workloads. We also propose compiler optimizations that reduce the latency of TML to within a small fraction of mutex overheads..Our evaluation of TML, using microbe

猛然一拉

cancellous-bone

https://doi.org/10.1007/978-3-642-86241-0llel programming. However, two nontrivial tasks still remain unresolved when we need nested data structures: The first is composing skeletons to generate and consume them; and the second is applying optimization theorems to obtain efficient parallel programs. In this paper, we propose a novel librar

殺死