Design and implementation of a Parallel Pthread Library (PPL) with parallelism and portability
โ Scribed by Chikara Sakamoto; Teruki Miyazaki; Masayuki Kuwayama; Keizo Saisho; Akira Fukuda
- Publisher
- John Wiley and Sons
- Year
- 1998
- Tongue
- English
- Weight
- 200 KB
- Volume
- 29
- Category
- Article
- ISSN
- 0882-1666
No coin nor oath required. For personal study only.
โฆ Synopsis
Although multi thread libraries have been implemented to provide threadsa unit of concurrent/parallel executionat user level, there is no thread library that provides both parallelism and portability. We designed and implemented the PPL (Parallel Pthread Library) with the following two requirements in mind: (1) It should permit parallel execution according to the system, and (2) it should provide a common thread environment for many operating systems and be highly portable. We employed a multi-routine approach to realize parallelism, separating the internal structure of PPL into two parts to expedite portability: namely, a virtual processor dependent module and a virtual processor-independent module. We implemented PPL in several systems and compared its performance with other user-level threads. Furthermore, we evaluated parallelism in multi-processor systems. The results show that PPL has sufficient portability and parallelism.
๐ SIMILAR VOLUMES
The constrained 2D cutting stock problem is an irregular problem with dynamic data structures, highly variable amounts of computation per task, and unpredictable amounts and patterns of communication. This paper describes the design and implementation of a parallel solution to this problem on a clus
We present the design, implementation, and evaluation of a runtime system based on collective I/O techniques for irregular applications. The design is motivated by the requirements of a large number of science and engineering applications including teraflops applications, where the data must be reor
## Abstract For Abstract see ChemInform Abstract in Full Text.
to the one taken in MD. In particular, they describe the linked-cell method of distributing computation in molecular dynamics simulations. As in MD, the linkedcell method assigns particles to processors based on their location in three-dimensional cells (domains in MD) of size greater or equal to cu