Sciweavers

1095 search results - page 25 / 219
» Efficient Algorithms for Average Completion Time Scheduling
Sort
View
GLOBECOM
2006
IEEE
15 years 12 months ago
Power Optimal Opportunistic Scheduling
Abstract— In this paper, we propose a power optimal opportunistic scheduling scheme for a multiuser single hop Time Division Multiple Access (TDMA) system. We formulate the probl...
Abhijeet Bhorkar, Abhay Karandikar, Vivek S. Borka...
RTSS
1998
IEEE
15 years 10 months ago
Efficient Object Sharing in Quantum-Based Real-Time Systems
We consider the problem of implementing shared objects in uniprocessor and multiprocessor real-time systems in which tasks are executed using a scheduling quantum. In most quantum...
James H. Anderson, Rohit Jain, Kevin Jeffay
ESA
2007
Springer
155views Algorithms» more  ESA 2007»
15 years 9 months ago
Complete, Exact and Efficient Implementation for Computing the Adjacency Graph of an Arrangement of Quadrics
We present a complete, exact and efficient implementation to compute the adjacency graph of an arrangement of quadrics, i.e. surfaces of algebraic degree 2. This is a major step t...
Laurent Dupont, Michael Hemmer, Sylvain Petitjean,...
CORR
2008
Springer
138views Education» more  CORR 2008»
15 years 6 months ago
Order-Optimal Consensus through Randomized Path Averaging
Gossip algorithms have recently received significant attention, mainly because they constitute simple and robust message-passing schemes for distributed information processing over...
Florence Bénézit, Alexandros G. Dima...
IPPS
2006
IEEE
15 years 12 months ago
Dynamic resource allocation of computer clusters with probabilistic workloads
Real-time resource scheduling is an important factor for improving the performance of cluster computing. In many distributed and parallel processing systems, particularly real-tim...
Marwan S. Sleiman, Lester Lipsky, Robert Sheahan