Sciweavers

1024 search results - page 72 / 205
» High-Level Execution Time Analysis
Sort
View
SIGMETRICS
1997
ACM
117views Hardware» more  SIGMETRICS 1997»
15 years 10 months ago
Informed Multi-Process Prefetching and Caching
Informed prefetching and caching based on application disclosure of future I/O accesses (hints) can dramatically reduce the execution time of I/O-intensive applications. A recent ...
Andrew Tomkins, R. Hugo Patterson, Garth A. Gibson
RTCSA
2003
IEEE
15 years 11 months ago
Introducing Temporal Analyzability Late in the Lifecycle of Complex Real-Time Systems
Many industrial real-time systems have evolved over a long period of time and were initially so simple that it was possible to predict consequences of adding new functionality by c...
Anders Wall, Johan Andersson, Jonas Neander, Chris...
ANSS
2003
IEEE
15 years 11 months ago
Performance Analysis of Parallel Job Scheduling in Distributed Systems
This paper studies parallel job scheduling in a distributed system. A simulation model is used to address performance issues associated with scheduling. Five policies are used to ...
Helen D. Karatza, Ralph C. Hilzer Jr.
PLDI
1990
ACM
15 years 10 months ago
Task Granularity Analysis in Logic Programs
While logic programming languages offer a great deal of scope for parallelism, there is usually some overhead associated with the execution of goals in parallel because of the wor...
Saumya K. Debray, Nai-Wei Lin, Manuel V. Hermenegi...
IANDC
2007
107views more  IANDC 2007»
15 years 6 months ago
Task automata: Schedulability, decidability and undecidability
We present a model, task automata, for real time systems with non-uniformly recurring computation tasks. It is an extended version of timed automata with asynchronous processes th...
Elena Fersman, Pavel Krcál, Paul Pettersson...