𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A comparative study of online scheduling algorithms for networks of workstations

✍ Scribed by Olaf Arndt; Bernd Freisleben; Thilo Kielmann; Frank Thilo


Book ID
110383013
Publisher
Springer US
Year
2000
Tongue
English
Weight
355 KB
Volume
3
Category
Article
ISSN
1386-7857

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


On Multicast Algorithms for Heterogeneou
✍ R. Libeskind-Hadas; J.R.K. Hartline; P. Boothe; G. Rae; J. Swisher πŸ“‚ Article πŸ“… 2001 πŸ› Elsevier Science 🌐 English βš– 197 KB

Networks of workstations (NOWs) provide an economical platform for high performance parallel computing. Such networks may comprise a variety of different types of workstations and network devices. This paper addresses the problem of efficient multicast in a heterogeneous communication model. Althoug

A Comparative Study of Cost Effective Mu
✍ Chunming Qiao; Yousong Mei πŸ“‚ Article πŸ“… 2001 πŸ› Elsevier Science 🌐 English βš– 360 KB

In this paper, we describe a framework for exploring various multiplexing approaches in optical networks and for evaluating their cost-effectiveness. A comparative study of two representative approaches, known as path multiplexing (PM) and link multiplexing (LM) [1,2], is conducted with respect to o

Clustering-based scheduling: A new class
✍ Sophia G. Petridou; Panagiotis G. Sarigiannidis; Georgios I. Papadimitriou; Andr πŸ“‚ Article πŸ“… 2008 πŸ› John Wiley and Sons 🌐 English βš– 279 KB

## Abstract In wavelength division multiplexing (WDM) star networks, the construction of the transmission schedule is a key issue, which essentially affects the network performance. Up to now, classic scheduling techniques consider the nodes' requests in a sequential service order. However, these a