Name
Abstract | ||
|---|---|---|
Load sharing or load balancing are generally described as ways to get better execution performances: lots of experimentations have been successfully carried out, usually on networks of workstations. In this article we present new aspects of the load balancing issue when applying it to multicomputers. The main constraints and motivations for a load balancing service on multicomputers are studied. We show that this service could rise to a distributed scheduling service, integrated in the operating system and could avoid the hard process mapping task. A description of a load balancing implementation under Chorus/MiX is given. |
Year | DOI | Venue |
|---|---|---|
1994 | 10.1007/3-540-57981-8_142 | HPCN |
Keywords | Field | DocType |
operating system,load balance | Fair-share scheduling,Scheduling (computing),Load balancing (computing),Computer science,Process migration,Parallel computing,Two-level scheduling,Rate-monotonic scheduling,Dynamic priority scheduling,Round-robin scheduling,Distributed computing | Conference |
ISBN | Citations | PageRank |
3-540-57981-8 | 0 | 0.34 |
References | Authors | |
1 | 2 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Laurent Philippe | 1 | 71 | 12.95 |
| Guy-René Perrin | 2 | 79 | 10.83 |