Name
Abstract | ||
|---|---|---|
Traditionally, interest in parallel computation centered around thespeedup provided by parallel algorithms over their sequential counterparts.In this paper, we ask a different type of question: Can parallelcomputers, due to their speed, do more than simply speed up the solutionto a problem? We show that for real-time optimization problems, aparallel computer can obtain a solution that is better than that obtainedby a sequential one. Specifically, a sequential and a parallel algorithmare... |
Year | DOI | Venue |
|---|---|---|
1999 | 10.1142/S0129626499000463 | Parallel Processing Letters |
Keywords | Field | DocType |
parallel algorithm,parallel computer,optimization,real time,parallel computation,speedup | Analysis of parallel algorithms,Parallel algorithm,Computer science,Parallel computing,Embarrassingly parallel,Algorithm,Spanning tree,Sequential algorithm,Optimization problem,Cost efficiency,Speedup | Journal |
Volume | Issue | Citations |
9 | 4 | 6 |
PageRank | References | Authors |
0.59 | 14 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Selim G. Akl | 1 | 2074 | 299.32 |
| Stefan D. Bruda | 2 | 62 | 12.18 |