Abstract | ||
---|---|---|
Concurrent object-oriented programming languages are an attractive approachfor programming massively-parallel machines. However, exploitingobject-level concurrency is problematic as the linkage and communicationoverhead can overwhelm the benefits of the fine-grained concurrency. Ourapproach achieves efficient execution by tuning the grain size, matching theexecution grain size to that efficiently supportable by the architecture. Toverify the feasibility of grain-size tuning, we study the... |
Year | DOI | Venue |
---|---|---|
1992 | 10.1007/3-540-57502-2_46 | LCPC |
Keywords | Field | DocType |
fine-grained concurrent programs,efficient execution,grain size,concurrent object oriented programming | Locality,Architecture,Programming language,Computer science,Concurrency,Parallel computing,Concurrent constraint logic programming,Concurrent object-oriented programming,Recursive data type | Conference |
ISBN | Citations | PageRank |
3-540-57502-2 | 6 | 0.92 |
References | Authors | |
9 | 4 |
Name | Order | Citations | PageRank |
---|---|---|---|
Andrew A. Chien | 1 | 3696 | 405.97 |
W. Feng | 2 | 13 | 1.91 |
Vijay Karamcheti | 3 | 646 | 67.03 |
John Plevyak | 4 | 156 | 19.65 |