Name
Abstract | ||
|---|---|---|
The concept ‘holistic algorithm’ is a MIMD paradigm for defining the highest level of parallelism possible in the design of an algorithm. In this paper we show how a general holistic algorithm may be implemented by using the monitor synchronization concept. As an application a holistic vertex enumeration algorithm is designed based on a sequential predecessor. |
Year | DOI | Venue |
|---|---|---|
1989 | 10.1016/0167-8191(89)90019-7 | PARALLEL COMPUTING |
Keywords | Field | DocType |
monitors,synchronization,parallel processing,vertex enumeration,algorithm design,multiprocessor algorithms | Synchronization,Algorithm design,Vertex (geometry),Computer science,Parallel computing,Parallel processing,Algorithm,Theoretical computer science,Multiprocessing,Enumeration algorithm,MIMD | Journal |
Volume | Issue | ISSN |
10 | 2 | 0167-8191 |
Citations | PageRank | References |
0 | 0.34 | 7 |
Authors | ||
1 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Sverre Storøy | 1 | 7 | 1.83 |