Sciweavers

4081 search results - page 22 / 817
» Scheduling in polling systems
Sort
View
ECRTS
1999
IEEE
13 years 12 months ago
The case for feedback control real-time scheduling
Despite the significant body of results in real-time scheduling, many real world problems are not easily supported. While algorithms such as Earliest Deadline First, Rate Monotoni...
Jack A. Stankovic, Chenyang Lu, Sang Hyuk Son, Gan...
AINA
2007
IEEE
14 years 2 months ago
A Flexible Scheduling Framework for Deeply Embedded Systems
— Typical embedded systems must perform rather complex control and communication tasks with severely restricted computing resources. Due to these contraints most systems are sing...
Karsten Walther, Jörg Nolte
RTAS
2008
IEEE
14 years 2 months ago
Hybrid-priority Scheduling of Resource-Sharing Sporadic Task Systems
A hybrid scheduling algorithm is proposed, which integrates features of the Fixed Priority (FP) and Earliest Deadline First (EDF) scheduling policies. It is shown that this hybrid...
Sanjoy K. Baruah, Nathan Fisher
USENIX
2001
13 years 9 months ago
Kqueue - A Generic and Scalable Event Notification Facility
Applications running on a UNIX platform need to be notified when some activity occurs on a socket or other descriptor, and this is traditionally done with the select() or poll() s...
Jonathan Lemon
USENIX
2000
13 years 9 months ago
Scalable Network I/O in Linux
Recent highly publicized benchmarks have suggested that Linux systems do not scale as well as other systems, such as Windows NT, when used as network servers. Windows NT contains ...
Niels Provos, Chuck Lever