Sciweavers

5683 search results - page 23 / 1137
» Interactive Schedulability Analysis
Sort
View
JCSS
2007
63views more  JCSS 2007»
13 years 8 months ago
Holistic analysis of asynchronous real-time transactions with earliest deadline scheduling
In distributed real-time systems, an application is often modeled as a set of real-time transactions, where each transaction is a chain of precedence-constrained tasks. Each task ...
Rodolfo Pellizzoni, Giuseppe Lipari
TC
2008
13 years 8 months ago
Deferrable Scheduling for Maintaining Real-Time Data Freshness: Algorithms, Analysis, and Results
The periodic update transaction model has been used to maintain the freshness (or temporal validity) of real-time data. Period and deadline assignment has been the main focus of pa...
Ming Xiong, Song Han, Kam-yiu Lam, Deji Chen
RTAS
2011
IEEE
13 years 3 days ago
FPZL Schedulability Analysis
— This paper presents the Fixed Priority until Zero Laxity (FPZL) scheduling algorithm for multiprocessor realtime systems. FPZL is similar to global fixed priority preemptive sc...
Robert I. Davis, Alan Burns
CSFW
2006
IEEE
14 years 2 months ago
Securing Interaction between Threads and the Scheduler
The problem of information flow in multithreaded programs remains an important open challenge. Existing approaches to specifying and enforcing information-flow security often su...
Alejandro Russo, Andrei Sabelfeld
OSDI
2000
ACM
13 years 9 months ago
Surplus Fair Scheduling: A Proportional-Share CPU Scheduling Algorithm for Symmetric Multiprocessors
In this paper, we present surplus fair scheduling (SFS), a proportional-share CPU scheduler designed for symmetric multiprocessors. We first show that the infeasibility of certain...
Abhishek Chandra, Micah Adler, Pawan Goyal, Prasha...