Sciweavers

297 search results - page 43 / 60
» A non-preemptive scheduling algorithm for soft real-time sys...
Sort
View
85
Voted
ECRTS
2007
IEEE
15 years 4 months ago
Tardiness Bounds for FIFO Scheduling on Multiprocessors
FIFO scheduling is often considered to be inappropriate for scheduling workloads that are subject to timing constraints. However, FIFO is implemented in many generalpurpose OSs, a...
Hennadiy Leontyev, James H. Anderson
RTSS
2002
IEEE
15 years 2 months ago
Dynamic Scan Scheduling
We present an approach to computing cyclic schedules online and in real time, while attempting to maximize a quality-of-service metric. The motivation is the detection of RF emitt...
Bruno Dutertre
RTCSA
2005
IEEE
15 years 3 months ago
Optimization of Hierarchically Scheduled Heterogeneous Embedded Systems
We present an approach to the analysis and optimization of heterogeneous distributed embedded systems for hard real-time applications. The systems are heterogeneous not only in te...
Traian Pop, Paul Pop, Petru Eles, Zebo Peng
CODES
2003
IEEE
15 years 2 months ago
Synthesis of real-time embedded software with local and global deadlines
Current methods cannot synthesize real-time embedded software applications when the global deadline of a task is shorter than the total of all local deadlines along a critical pat...
Pao-Ann Hsiung, Cheng-Yi Lin
GECCO
2006
Springer
155views Optimization» more  GECCO 2006»
15 years 1 months ago
Comparison of genetic representation schemes for scheduling soft real-time parallel applications
This paper presents a hybrid technique that combines List Scheduling (LS) with Genetic Algorithms (GA) for constructing non-preemptive schedules for soft real-time parallel applic...
Yoginder S. Dandass, Amit C. Bugde