Design and implementation of a Parallel Pthread Library (PPL) with parallelism and portability

Sakamoto, Chikara; Miyazaki, Teruki; Kuwayama, M.; Saisho, Keizo; Fukuda, Akira

doi:10.1002/(sici)1520-684x(199802)29:2<28::aid-scj4>3.0.co;2-s

Cited by 7 publications

References 1 publication

Supporting

Mentioning

Contrasting

Order By: Relevance

Lesser Bear—a light‐weight process library for SMP computers

Oguma

Nakayama

2001

Concurrency and Computation

View full text Add to dashboard Cite

SUMMARYWe have designed and implemented a light-weight process (thread) library called 'Lesser Bear' for SMP computers. Lesser Bear has high portability and thread-level parallelism. Creating UNIX processes as virtual processors and a memory-mapped file as a huge shared-memory space enables Lesser Bear to execute threads in parallel. Lesser Bear requires exclusive operation between peer virtual processors, and treats a shared-memory space as a critical section for synchronization of threads. Therefore, thread functions of the previous Lesser Bear are serialized. In this paper, we present a scheduling mechanism to execute thread functions in parallel. In the design of the proposed mechanism, we divide the entire shared-memory space into partial spaces for virtual processors, and prepare two queues (Protect Queue and Waiver Queue) for each partial space. We adopt an algorithm in which lock operations are not necessary for enqueueing. This algorithm allows us to propose a scheduling mechanism that can reduce the scheduling overhead. The mechanism is applied to Lesser Bear and evaluated by experimental results.

show abstract

Lesser Bear—a light‐weight process library for SMP computers

Oguma

Nakayama

2001

Concurrency and Computation

View full text Add to dashboard Cite

show abstract

Lesser Bear: A lightweight process library for SMP computers—scheduling mechanism without a lock operation

Oguma

Nakayama

2002

Concurrency and Computation

View full text Add to dashboard Cite

SUMMARYWe have designed and implemented a lightweight process (thread) library called 'Lesser Bear' for SMP computers. Lesser Bear has thread-level parallelism and high portability. Lesser Bear executes threads in parallel by creating UNIX processes as virtual processors and a memory-mapped file as a huge sharedmemory space. To schedule thread in parallel, the shared-memory space has been divided into working spaces for each virtual processor, and a ready queue has been distributed.However the previous version of Lesser Bear sometimes requires a lock operation for dequeueing. We therefore proposed a scheduling mechanism that does not require a lock operation. To achieve this, each divided space forms a link topology through the queues, and we use a lock-free algorithm for the queue operation. This mechanism is applied to Lesser Bear and evaluated by experimental results.

show abstract

GPU-centered parallel model on heterogeneous multi-GPU clusters

Wang

2012

Proceedings of 2012 2nd International Conference on Computer Science and Network Technology

View full text Add to dashboard Cite

Design and implementation of a Parallel Pthread Library (PPL) with parallelism and portability

Cited by 7 publications

References 1 publication

Lesser Bear—a light‐weight process library for SMP computers

Lesser Bear—a light‐weight process library for SMP computers

Lesser Bear: A lightweight process library for SMP computers—scheduling mechanism without a lock operation

GPU-centered parallel model on heterogeneous multi-GPU clusters

Contact Info

Product

Resources

About