Abstract | ||
---|---|---|
We study the comparison between an m-processor (multiprocessor) system and a single-processor system whose processor is m times as fast as any in the multiprocessor system. The expected superiority of the single-processor system is measured in terms of mean and maximum flow times, using both combinatorial and probabilistic models. |
Year | DOI | Venue |
---|---|---|
1980 | 10.1145/800053.801911 | ISCA |
Keywords | Field | DocType |
multiple processor system,maximum flow time,single-processor system,probabilistic model,multiprocessor system,m time,expected superiority,distributed architecture,operating systems,maximum flow | Memory sharing,Computer science,Parallel computing,Symmetric multiprocessor system,Distributed memory,Real-time computing,Multiprocessing,Maximum flow problem,Probabilistic logic | Conference |
Citations | PageRank | References |
0 | 0.34 | 0 |
Authors | ||
2 |
Name | Order | Citations | PageRank |
---|---|---|---|
Edward G. Coffman Jr. | 1 | 2028 | 1442.37 |
Kimming So | 2 | 341 | 83.11 |