Sciweavers

108 search results - page 4 / 22
» Compactly representing parallel program executions
Sort
View
PLDI
1999
ACM
15 years 1 months ago
Whole Program Paths
Whole program paths (WPP) are a new approach to capturing and representing a program’s dynamic—actually executed—control flow. Unlike other path profiling techniques, which ...
James R. Larus
AAAI
1994
14 years 11 months ago
Structured Circuit Semantics for Reactive Plan Execution Systems
A variety of reactive plan execution systems have been developed in recent years, each attempting to solve the problem of taking reasonable courses of action fast enough in a dyna...
Jaeho Lee, Edmund H. Durfee
ICPP
1999
IEEE
15 years 1 months ago
SLC: Symbolic Scheduling for Executing Parameterized Task Graphs on Multiprocessors
Task graph scheduling has been found effective in performance prediction and optimization of parallel applications. A number of static scheduling algorithms have been proposed for...
Michel Cosnard, Emmanuel Jeannot, Tao Yang
EUROPAR
1998
Springer
15 years 1 months ago
Performance Measurement of Interpreted Programs
Abstract. In an interpreted execution there is an interdependence between the interpreter's execution and the interpreted application's execution; the implementation of t...
Tia Newhall, Barton P. Miller
COMPSAC
2003
IEEE
15 years 2 months ago
An Object-Passing Model for Parallel Programming
This paper introduces an object-passing model for parallel and distributed application development. Object passing provides the object-oriented application developer with powerful...
Jameela Al-Jaroodi, Nader Mohamed