𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Design and evaluation of an efficient proportional-share disk scheduling algorithm

✍ Scribed by Young Jin Nam; Chanik Park

Book ID
108137380
Publisher
Elsevier Science
Year
2006
Tongue
English
Weight
524 KB
Volume
22
Category
Article
ISSN
0167-739X

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Design, implementation and evaluation of
Design, implementation and evaluation of ICARE: an efficient recoverable DSM
✍ A.-M. Kermarrec; C. Morin; M. BanΓ’tre πŸ“‚ Article πŸ“… 1998 πŸ› John Wiley and Sons 🌐 English βš– 348 KB πŸ‘ 2 views

In the light of the increasing throughput of local area networks, Networks Of Workstations (NOWs) which provide a Distributed Shared Memory (DSM) have become a convenient and cheaper alternative to parallel architectures in the framework of parallel scientific applications. However, the probability

An efficient branch-and-bound algorithm
An efficient branch-and-bound algorithm for the two-machine bicriteria flowshop scheduling problem
✍ Wei-Chang Yeh πŸ“‚ Article πŸ“… 2001 πŸ› Society of Manufacturing Engineers 🌐 English βš– 826 KB

In this study, the two-machine bicriteria flowshop scheduling problem is addressed. The objective is to minimize a weighted sum of total flowtime and makespan. Different branch-and-bound algorithms have already appeared in the literature for this problem. In this study, a more efficient branch-and-b

Efficiently implementing two methods of
Efficiently implementing two methods of the geometrical theory of differential equations: An experience in algorithm and software design
✍ A. V. Bocharov; M. L. Bronstein πŸ“‚ Article πŸ“… 1989 πŸ› Springer Netherlands 🌐 English βš– 951 KB

This paper contains an analysis of the two computational schemes for finding the infinitesimal symmetries and conservation laws of arbitrary systems of differential equations. The design of efficient algorithms implementing these computational schemes is described, together with the design of a port