Sciweavers

2274 search results - page 368 / 455
» Real-Time Scheduling in Distributed Systems
Sort
View
ECRTS
2004
IEEE
15 years 4 months ago
Static Determination of Probabilistic Execution Times
Most previous research done in probabilistic schedulability analysis assumes a known distribution of execution times for each task of a real-time application. This is however not ...
Laurent David, Isabelle Puaut
100
Voted
QEST
2009
IEEE
15 years 7 months ago
A Performance Model of Zoned Disk Drives with I/O Request Reordering
—Disk drives are a common performance bottleneck in modern storage systems. To alleviate this, disk manufacturers employ a variety of I/O request scheduling strategies which aim ...
Abigail S. Lebrecht, Nicholas J. Dingle, William J...
112
Voted
WOSP
2005
ACM
15 years 6 months ago
Applying SPE techniques for modeling a grid-enabled JAVA platform
Advances in Internet and the availability of powerful computers and high-speed networks have propitiated the rise of Grids. The scheduling of applications is complex in Grids due ...
Mariela Curiel, M. Angélica Pérez, R...
ICS
2000
Tsinghua U.
15 years 4 months ago
Hardware-only stream prefetching and dynamic access ordering
Memory system bottlenecks limit performance for many applications, and computations with strided access patterns are among the hardest hit. The streams used in such applications h...
Chengqiang Zhang, Sally A. McKee
125
Voted
LCTRTS
2010
Springer
14 years 10 months ago
Translating concurrent action oriented specifications to synchronous guarded actions
Concurrent Action-Oriented Specifications (CAOS) model the behavior of a synchronous hardware circuit as asynchronous guarded at an abstraction level higher than the Register Tran...
Jens Brandt, Klaus Schneider, Sandeep K. Shukla