| |
Record |
Links |
|
Type |
McCreary, C.; Gill, H. |
| |
Title |
Automatic Determination of Grain Size for Efficient Parallel Processing |
Type |
Journal Article |
| |
Year |
1989 |
Publication |
Communications of the ACM |
Abbreviated Journal |
|
|
| |
Volume |
32 |
Issue |
9 |
Pages |
1073-1078 |
|
| |
Keywords |
operating system, grain size, scheduling, data flow, Hasse graph, clans, |
|
| |
Abstract |
Rather than fixing the grain size of parallelism by the programmer this paper describes a method to determine a nearly optimal grain size automatically. A flow graph is partitioned into so called clans. Each clan can be of type primitive, linear or independent. Given the execution times of the processes, the communication time between processes, the number of processors and the clan types a CPU schedule can be determined. |
|
| |
Address |
|
|
| |
Corporate Author |
|
Thesis |
|
|
| |
Publisher |
|
Place of Publication |
|
Editor |
|
|
| |
Language |
|
Summary Language |
|
Original Title |
|
|
| |
Series Editor |
|
Series Title |
|
Abbreviated Series Title |
|
|
| |
Series Volume |
|
Series Issue |
|
Edition |
|
|
| |
ISSN |
|
ISBN |
|
Medium |
|
|
| |
Area |
|
Expedition |
|
Conference |
|
|
| |
Notes |
Communications of the ACM |
Approved |
no |
|
| |
Call Number |
refbase @ user @ ownjournal |
Serial |
9129 |
|
| Permanent link to this record |
