Name
Title | ||
|---|---|---|
A Self-Modifiable Approach To Scheduling And Mapping Algorithms In Multiprocessor Systems |
Abstract | ||
|---|---|---|
A formal method for scheduling algorithms in multiprocessor architectures is presented. The approach can be used for synthesis of processes in distributed systems and massively parallel architectures with asynchronous or synchronous parallelism. It is assumed that a global virtual job to be performed is given, and is necessary to subdivide it into subtasks performed by individual processors and to add appropriate communication and synchronization structure to preserve a final global job intact.This task is performed using a formal environment of the Calculus of Self-Modifiable Algorithms-a generic tool for parallel problem solving. Due to the generality of the approach, it can be used in a majority of parallel environments. |
Year | DOI | Venue |
|---|---|---|
1996 | 10.1080/00207169608804461 | INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS |
Keywords | Field | DocType |
scheduling, multiprocessor system, parallelism, self-modification | Asynchronous communication,Synchronization,Multiprocessor scheduling,Scheduling (computing),Computer science,Massively parallel,Parallel computing,Multiprocessing,Formal methods,Generality,Distributed computing | Journal |
Volume | Issue | ISSN |
59 | 3-4 | 0020-7160 |
Citations | PageRank | References |
0 | 0.34 | 9 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Eugeniusz Eberbach | 1 | 38 | 8.70 |
| Waldemar W. Koczkodaj | 2 | 628 | 100.50 |