Semi-distributed load balancing for massively parallel multicomputer systems

A semidistributed approach is given for load balancing in large parallel and distributed systems which is different from the conventional centralized and fully distributed approaches. The proposed strategy uses a two-level hierarchical control by partitioning the interconnection structure of a distr...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:IEEE transactions on software engineering Ročník 17; číslo 10; s. 987 - 1004
Hlavní autoři: Ahmad, I., Ghafoor, A.
Médium: Journal Article
Jazyk:angličtina
Vydáno: New York, NY IEEE 01.10.1991
Institute of Electrical and Electronics Engineers
IEEE Computer Society
Témata:
Algorithms
Applied sciences
Communication
Computer networks
Computer science; control theory; systems
Concurrent computing
Control systems
Delay
Distributed processing
Exact sciences and technology
Integer programming
Interconnect
Load
Load management
Multiprocessing
Multiprocessor interconnection networks
Optimization techniques
Parallel processing
Partitioning algorithms
Power engineering computing
Processor scheduling
Resource management
Response time
Scheduling
Scheduling algorithm
Simulation
Software
Software engineering
Spheres
Theory
Performance evaluation
Balancing
Software development
Parallel system
Interconnected power system
Task scheduling
Distributed system
ISSN:0098-5589, 1939-3520
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:A semidistributed approach is given for load balancing in large parallel and distributed systems which is different from the conventional centralized and fully distributed approaches. The proposed strategy uses a two-level hierarchical control by partitioning the interconnection structure of a distributed or multiprocessor system into independent symmetric regions (spheres) centered at some control points. The central points, called schedulers, optimally schedule tasks within their spheres and maintain state information with low overhead. The authors consider interconnection structures belonging to a number of families of distance transitive graphs for evaluation, and, using their algebraic characteristics, show that identification of spheres and their scheduling points is in general an NP-complete problem. An efficient solution for this problem is presented by making exclusive use of a combinatorial structure known as the Hadamard matrix. The performance of the proposed strategy has been evaluated and compared with an efficient fully distributed strategy through an extensive simulation study. The proposed strategy yielded much better results.< >
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
content type line 14
ObjectType-Article-2
ObjectType-Feature-1
content type line 23
ISSN:0098-5589
1939-3520
DOI:10.1109/32.99188