Sciweavers

339 search results - page 24 / 68
» Performance of Fair Distributed Mutual Exclusion Algorithms
Sort
View
IFL
2003
Springer
144views Formal Methods» more  IFL 2003»
14 years 22 days ago
Building an Interface Between Eden and Maple: A Way of Parallelizing Computer Algebra Algorithms
Eden is a parallel functional language extending Haskell with processes. This paper describes the implementation of an interface between the Eden language and the Maple system. The...
Rafael Martínez, Ricardo Pena
CLUSTER
2000
IEEE
13 years 7 months ago
Dynamic Max-Min fairness in ring networks
Ring networks are enjoying renewed interest as Storage Area Networks (SANs), i.e., networks for interconnecting storage devices (e.g., disk, disk arrays and tape drives) and stora...
Giuseppe Anastasi, Luciano Lenzini, M. La Porta, Y...
ICDCS
2008
IEEE
14 years 2 months ago
Availability and Fairness Support for Storage QoS Guarantee
Multi-dimensional storage virtualization (MDSV) allows multiple virtual disks, each with a distinct combination of capacity, latency and bandwidth requirements, to be multiplexed ...
Gang Peng, Tzi-cker Chiueh
IPPS
2002
IEEE
14 years 14 days ago
Load Balancing in Distributed Systems: An Approach Using Cooperative Games
In this paper we formulate the static load balancing problem in single class job distributed systems as a cooperative game among computers. It is shown that the Nash Bargaining So...
Daniel Grosu, Anthony T. Chronopoulos, Ming-Ying L...
WIOPT
2006
IEEE
14 years 1 months ago
Fairness and throughput guarantees with maximal scheduling in multi-hop wireless networks
Abstract— We investigate the fairness and throughput properties of a simple distributed scheduling policy, maximal scheduling, in the context of a general ad-hoc wireless network...
Saswati Sarkar, Prasanna Chaporkar, Koushik Kar