Sciweavers

304 search results - page 23 / 61
» Privacy-Enhanced Event Scheduling
Sort
View
IPPS
2007
IEEE
14 years 2 months ago
Fault-Tolerant Earliest-Deadline-First Scheduling Algorithm
The general approach to fault tolerance in uniprocessor systems is to maintain enough time redundancy in the schedule so that any task instance can be re-executed in presence of f...
Hakem Beitollahi, Seyed Ghassem Miremadi, Geert De...
GLOBECOM
2010
IEEE
13 years 6 months ago
Routing and Scheduling in Distributed Advance Reservation Networks
Advance reservation of connection requests is a growing focus area and a range of solutions have been proposed. However, most efforts here have focused on scheduling algorithm desi...
Chongyang Xie, Hamad Alazemi, Nasir Ghani
ICCS
2005
Springer
14 years 2 months ago
On the Impact of Reservations from the Grid on Planning-Based Resource Management
Advance Reservations are an important concept to support QoS and Workflow Scheduling in Grid environments. However, the impact of reservations from the Grid on the performance of ...
Felix Heine, Matthias Hovestadt, Odej Kao, Achim S...
JSSPP
2001
Springer
14 years 27 days ago
Coscheduling under Memory Constraints in a NOW Environment
Networks of Workstations (NOW) have become important and cost-effective parallel platforms for scientific computations. In practice, a NOW system is heterogeneous and non-dedicat...
Francesc Giné, Francesc Solsona, Porfidio H...
DAC
2000
ACM
14 years 9 months ago
Symbolic timing simulation using cluster scheduling
We recently introduced symbolic timing simulation (STS) using data-dependent delays as a tool for verifying the timing of fullcustom transistor-level circuit designs, and for the ...
Clayton B. McDonald, Randal E. Bryant