Sciweavers

2714 search results - page 80 / 543
» Approximation Schemes for Scheduling
Sort
View
ECRTS
2000
IEEE
15 years 5 months ago
Tolerating faults while maximizing reward
The imprecise computation(IC) model is a general scheduling framework, capable of expressing the precision vs. timeliness trade-off involved in many current real-time applications...
Hakan Aydin, Rami G. Melhem, Daniel Mossé
106
Voted
RTSS
2005
IEEE
15 years 6 months ago
A Deferrable Scheduling Algorithm for Real-Time Transactions Maintaining Data Freshness
Periodic update transaction model has been used to maintain freshness (or temporal validity) of real-time data. Period and deadline assignment has been the main focus in the past ...
Ming Xiong, Song Han, Kam-yiu Lam
LCN
2003
IEEE
15 years 5 months ago
Scheduling Resources in Programmable and Active Networks Based on Adaptive Estimations
In active and programmable networks, packet processing could be accomplished in the router within the data path. For efficient resource allocation in such networks, the packet sch...
Fariza Sabrina, Sanjay Jha
IEEEPACT
2002
IEEE
15 years 5 months ago
Exploiting Pseudo-Schedules to Guide Data Dependence Graph Partitioning
This paper presents a new modulo scheduling algorithm for clustered microarchitectures. The main feature of the proposed scheme is that the assignment of instructions to clusters ...
Alex Aletà, Josep M. Codina, F. Jesú...
ADC
2004
Springer
141views Database» more  ADC 2004»
15 years 4 months ago
Conflict Scheduling of Transactions on XML Documents
In the last few years an interest in native XML databases has surfaced. With other authors we argue that such databases need their own provisions for concurrency control since tra...
Stijn Dekeyser, Jan Hidders