Name
Abstract | ||
|---|---|---|
Cubic and noncubic task allocation algorithms for multistage-interconnection-network (MIN)-based multiprocessors are presented. Conflicts in passage through the network and inability to partition the system effectively are the main bottlenecks in a MIN-based system. To solve both problems, a renaming scheme called bit reversal (BR) matching pattern is proposed. This matching pattern minimizes conflicts and partitions the system completely into subsystems. Simulation results that show the advantage of allocation algorithms using the proposed matching pattern in terms of system efficiency, delay, and task miss ratio are presented |
Year | DOI | Venue |
|---|---|---|
1992 | 10.1109/ICDCS.1992.235058 | ICDCS |
Keywords | Field | DocType |
task miss ratio,delay,scheduling,allocation algorithms,multiprocessor interconnection networks,bit reversal,noncubic task allocation algorithms,system efficiency,renaming scheme,resource allocation,cubic task allocation algorithms,multistage interconnection network machines,computational complexity,matching pattern,multitasking,multiprogramming,system completely,intelligent networks,pattern matching,hypercubes,scheduling algorithm | Computer science,Scheduling (computing),Parallel computing,Resource allocation,Computer multitasking,Intelligent Network,Interconnection,Human multitasking,Pattern matching,Computational complexity theory,Distributed computing | Conference |
ISBN | Citations | PageRank |
0-8186-2865-0 | 0 | 0.34 |
References | Authors | |
10 | 2 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Chansu Yu | 1 | 0 | 0.34 |
| Chita R. Das | 2 | 1046 | 45.21 |