Sciweavers

1719 search results - page 140 / 344
» Scheduling with soft constraints
Sort
View
DATE
2002
IEEE
123views Hardware» more  DATE 2002»
14 years 3 months ago
False Path Elimination in Quasi-Static Scheduling
We have developed a technique to compute a Quasi Static Schedule of a concurrent specification for the software partition of an embedded system. Previous work did not take into a...
G. Arrigoni, L. Duchini, Claudio Passerone, Lucian...
HPDC
2002
IEEE
14 years 3 months ago
Decoupling Computation and Data Scheduling in Distributed Data-Intensive Applications
In high energy physics, bioinformatics, and other disciplines, we encounter applications involving numerous, loosely coupled jobs that both access and generate large data sets. So...
Kavitha Ranganathan, Ian T. Foster
HEURISTICS
2008
92views more  HEURISTICS 2008»
13 years 10 months ago
Learning heuristics for basic block instruction scheduling
Instruction scheduling is an important step for improving the performance of object code produced by a compiler. A fundamental problem that arises in instruction scheduling is to ...
Abid M. Malik, Tyrel Russell, Michael Chase, Peter...
TC
2008
13 years 10 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
JCSS
2007
63views more  JCSS 2007»
13 years 10 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