Sciweavers

4894 search results - page 564 / 979
» Choices
Sort
View
AICT
2005
IEEE
194views Communications» more  AICT 2005»
16 years 13 days ago
Approximations to Maximum Weight Matching Scheduling Algorithms of Low Complexity
The choice of the scheduling algorithm is a major design criteria of a switch. Whereas it is known that maximum weight matching algorithms guarantee the stability of an input queu...
Claus Bauer
APCSAC
2005
IEEE
16 years 13 days ago
A Fault-Tolerant Routing Strategy for Fibonacci-Class Cubes
Fibonacci Cubes (FCs), together with the enhanced and extended forms, are a family of interconnection topologies formed by diluting links from binary hypercube. While they scale up...
Zhang Xinhua, Peter Loh
CCGRID
2005
IEEE
16 years 13 days ago
A batch scheduler with high level components
In this article we present the design choices and the evaluation of a batch scheduler for large clusters, named OAR. This batch scheduler is based upon an original design that emp...
Nicolas Capit, Georges Da Costa, Yiannis Georgiou,...
CODES
2005
IEEE
16 years 13 days ago
Satisfying real-time constraints with custom instructions
Instruction-set extensible processors allow an existing processor core to be extended with application-specific custom instructions. In this paper, we explore a novel application...
Pan Yu, Tulika Mitra
COLCOM
2005
IEEE
16 years 13 days ago
Location assisted routing for near-far effect mitigation in wireless networks
CDMA technology represents an attractive choice for various wireless ad hoc networks applications, due to its appealing properties, such as resistance to jamming and interference,...
Hassan Mahmood, Cristina Comaniciu