Sciweavers

262 search results - page 9 / 53
» End-to-End Scheduling to Meet Deadlines in Distributed Syste...
Sort
View
ICDCS
2000
IEEE
15 years 4 months ago
Scheduling Heuristics for Data Requests in an Oversubscribed Network with Priorities and Deadlines
Providing up-to-date input to users’ applications is an important data management problem for a distributed computing environment, where each data storage location and intermedi...
Mitchell D. Theys, Noah Beck, Howard Jay Siegel, M...
132
Voted
ICDCS
1995
IEEE
15 years 3 months ago
Analysis of Resource Lower Bounds in Real-Time Applications
Tasks in a real-time application usually have several stringent timing, resource, and communication requirements. Designing a distributed computing system which can meet all these...
Raed Alqadi, Parameswaran Ramanathan
ECRTS
2007
IEEE
15 years 6 months ago
The Global Feasibility and Schedulability of General Task Models on Multiprocessor Platforms
Feasibility analysis determines (prior to system execution-time) whether a specified collection of hard-realtime jobs executed on a processing platform can meet all deadlines. In...
Nathan Fisher, Sanjoy K. Baruah
ECAI
2000
Springer
15 years 4 months ago
Scheduling Meetings Using Distributed Valued Constraint Satisfaction Algorithm
Abstract. Scheduling meetings is generally difficult in that it attempts to satisfy the preferences of all participants. However, all participants can agree to a schedule in which...
Takuo Tsuruta, Toramatsu Shintani
RTS
1998
104views more  RTS 1998»
14 years 11 months ago
Real-Time Schedulability Tests for Preemptive Multitasking
When developing multitasking real-time systems, schedulability tests are used to formally prove that a given task set will meet its deadlines. A wide range of such tests have appe...
Colin J. Fidge