Sciweavers

70 search results - page 14 / 14
» Multi-Token Distributed Mutual Exclusion Algorithm
Sort
View
CIAC
2000
Springer
210views Algorithms» more  CIAC 2000»
13 years 9 months ago
Computing a Diameter-Constrained Minimum Spanning Tree in Parallel
A minimum spanning tree (MST) with a small diameter is required in numerous practical situations. It is needed, for example, in distributed mutual exclusion algorithms in order to ...
Narsingh Deo, Ayman Abdalla
INFOCOM
2008
IEEE
13 years 11 months ago
Feasible Rate Allocation in Wireless Networks
—Rate allocation is a fundamental problem in the operation of a wireless network because of the necessity to schedule the operation of mutually interfering links between the node...
Ramakrishna Gummadi, Kyomin Jung, Devavrat Shah, R...
ICPPW
2009
IEEE
13 years 11 months ago
Multiprocessor Synchronization and Hierarchical Scheduling
Multi-core architectures have received significant interest as thermal and power consumption problems limit further increase of speed in single-cores. In the multi-core research ...
Farhang Nemati, Moris Behnam, Thomas Nolte
SIGCOMM
2009
ACM
13 years 11 months ago
Optimizing the BSD routing system for parallel processing
The routing architecture of the original 4.4BSD [3] kernel has been deployed successfully without major design modification for over 15 years. In the unified routing architectur...
Qing Li, Kip Macy
GIS
2004
ACM
14 years 5 months ago
A serverless 3D world
Online multi-participant virtual-world systems have attracted significant interest from the Internet community but are hindered by their inability to efficiently support interacti...
Egemen Tanin, Aaron Harwood, Hanan Samet, Sarana N...