Sciweavers

1095 search results - page 79 / 219
» Efficient Algorithms for Average Completion Time Scheduling
Sort
View
BSDCON
2003
14 years 11 months ago
ULE: A Modern Scheduler for FreeBSD
The existing thread scheduler in FreeBSD was well suited towards the computing environment that it was developed in. As the priorities and hardware targets of the project have cha...
Jeff Roberson
RV
2010
Springer
171views Hardware» more  RV 2010»
14 years 8 months ago
Runtime Verification for Software Transactional Memories
Software transactional memories (STMs) promise simple and efficient concurrent programming. Several correctness properties have been proposed for STMs. Based on a bounded conflict ...
Vasu Singh
INFOCOM
2010
IEEE
14 years 8 months ago
Distributed Opportunistic Scheduling for Ad-Hoc Communications Under Delay Constraints
—With the convergence of multimedia applications and wireless communications, there is an urgent need for developing new scheduling algorithms to support real-time traffic with ...
Sheu-Sheu Tan, Dong Zheng, Junshan Zhang, James R....
CISIM
2008
IEEE
15 years 4 months ago
Scheduling in Multiprocessor System Using Genetic Algorithms
Multiprocessors have emerged as a powerful computing means for running real-time applications, especially where a uniprocessor system would not be sufficient enough to execute all...
Keshav P. Dahal, M. Alamgir Hossain, Benny Varghes...
EMSOFT
2007
Springer
15 years 4 months ago
Optimal task placement to improve cache performance
Most recent embedded systems use caches to improve their average performance. Current timing analyses are able to compute safe timing guarantees for these systems, if tasks are ru...
Gernot Gebhard, Sebastian Altmeyer