Loading...
Please wait, while we are loading the content...
Similar Documents
Efficient Support for Fine-Grain Parallelism on Shared-Memory Machines (1996)
| Content Provider | CiteSeerX |
|---|---|
| Author | Lowenthal, David Freeh, Vincent W. Andrews, Gregory R. |
| Abstract | A coarse-grain parallel program typically has one thread (task) per processor, whereas a fine-grain program has one thread for each independent unit of work. Although there are several advantages to fine-grain parallelism, conventional wisdom is that coarse-grain parallelism is more efficient. This paper illustrates the advantages of fine-grain parallelism and presents an efficient implementation for shared-memory machines. The approach has been implemented in a portable software package called Filaments, which employs a unique combination of techniques to achieve efficiency. The performance of the fine-grain programs discussed in this paper is always within 13% of a handcoded coarse-grain program and is usually within 5 percent. 1 Introduction The typical approach to writing a parallel program for a p-processor machine is to divide the application into p tasks and then to execute each task on a distinct processor. For example, to multiply two n \Theta n matrices one can partition th... |
| File Format | |
| Language | English |
| Publisher Date | 1996-01-01 |
| Access Restriction | Open |
| Subject Keyword | Fine-grain Parallelism Shared-memory Machine Efficient Support Fine-grain Program Efficient Implementation Independent Unit Distinct Processor Portable Software Package P-processor Machine Typical Approach Parallel Program Unique Combination Coarse-grain Parallelism Conventional Wisdom Handcoded Coarse-grain Program Several Advantage Coarse-grain Parallel Program |
| Content Type | Text |
| Resource Type | Technical Report |
