article · 2001

Efficient Support for Fine-Grain Parallelism on Shared-Memory Machines £

David K. Lowenthal Ý, Vincent W. Freeh Þ, Gregory R. Andrews Ü

Cited by 0Abstract and details only

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 hand-coded coarse-grain program and is usually within 5 percent. 1

Cite this paper

APA 7

Ý, D. K. L., Þ, V. W. F., & Ü, G. R. A. (2001). Efficient Support for Fine-Grain Parallelism on Shared-Memory Machines £.

MLA 9

Ý, David K. Lowenthal, et al. “Efficient Support for Fine-Grain Parallelism on Shared-Memory Machines £.” 2001.

Chicago

Ý, David K. Lowenthal, Vincent W. Freeh Þ, and Gregory R. Andrews Ü. 2001. “Efficient Support for Fine-Grain Parallelism on Shared-Memory Machines £.”

Harvard

Ý, D.K.L., Þ, V.W.F. and Ü, G.R.A. (2001) ‘Efficient Support for Fine-Grain Parallelism on Shared-Memory Machines £’.

BibTeX

@article{y2001efficient,
  title = {{Efficient Support for Fine-Grain Parallelism on Shared-Memory Machines £}},
  author = {Ý, David K. Lowenthal and Þ, Vincent W. Freeh and Ü, Gregory R. Andrews},
  year = {2001}
}

Made from the index record. Check names, capitalisation and page numbers against the paper. Need another style? AI for Research has over 10,000.