Sciweavers

70 search results - page 4 / 14
» On the queue-overflow probabilities of distributed schedulin...
Sort
View
155
Voted
GLVLSI
2006
IEEE
155views VLSI» more  GLVLSI 2006»
15 years 10 months ago
Dynamic voltage scaling for multitasking real-time systems with uncertain execution time
Dynamic voltage scaling (DVS) for real-time systems has been extensively studied to save energy. Previous studies consider the probabilistic distributions of tasks’ execution ti...
Changjiu Xian, Yung-Hsiang Lu
SC
2009
ACM
15 years 10 months ago
Supporting fault-tolerance for time-critical events in distributed environments
In this paper, we consider the problem of supporting fault tolerance for adaptive and time-critical applications in heterogeneous and unreliable grid computing environments. Our g...
Qian Zhu, Gagan Agrawal
GLOBECOM
2006
IEEE
15 years 10 months ago
Throughput Guarantees for Wireless Networks with Opportunistic Scheduling
In this letter we develop an expression for the approximate throughput guarantee violation probability (TGVP) for users in time-slotted networks for any scheduling algorithm with ...
Vegard Hassel, Geir E. Øien, David Gesbert
CCGRID
2005
IEEE
15 years 9 months ago
A dynamically adaptive hybrid algorithm for scheduling lightpaths in lambda-grids
This paper focuses on the scheduling of multiple-wavelength lightpaths and outlines an algorithm to provide increased simultaneous allocations of lightpaths on the Lambda-Grid. Se...
Neena R. Kaushik, Silvia M. Figueira
120
Voted
SPAA
2006
ACM
15 years 9 months ago
The cache complexity of multithreaded cache oblivious algorithms
We present a technique for analyzing the number of cache misses incurred by multithreaded cache oblivious algorithms on an idealized parallel machine in which each processor has a...
Matteo Frigo, Volker Strumpen