Results 1 - 10
of
38,288
Execution Time
, 1997
"... memory simulation, memory hierarchy, automatic program parallelisation This paper describes a performance estimating system developed at the University of Southampton for estimating the execution time of SPMD Fortran programs on distributed memory parallel systems. The system called PERFORM, (Perfor ..."
Abstract
- Add to MetaCart
memory simulation, memory hierarchy, automatic program parallelisation This paper describes a performance estimating system developed at the University of Southampton for estimating the execution time of SPMD Fortran programs on distributed memory parallel systems. The system called PERFORM
Execution Times
, 2009
"... The information provided is the sole responsibility of the authors and does not necessarily reflect the opinion of the members of IRIDIA. The authors take full responsability for any copyright breaches that may result from publication of this paper in the IRIDIA – Technical Report Series. IRIDIA is ..."
Abstract
- Add to MetaCart
The information provided is the sole responsibility of the authors and does not necessarily reflect the opinion of the members of IRIDIA. The authors take full responsability for any copyright breaches that may result from publication of this paper in the IRIDIA – Technical Report Series. IRIDIA is not responsible for any use that might be made of data appearing in this publication. Optimal Collective Decision-Making through
The relation of scalability and execution time
- In Proc. of the International Parallel Processing Symposium'96
, 1996
"... Scalability has been used extensively as a de facto performance criterion for evaluating parallel algorithms and architectures. However, for many, scalability has theoretical interests only since it does not reveal execution time. In this paper, the relation between scalability and execution time is ..."
Abstract
-
Cited by 6 (4 self)
- Add to MetaCart
Scalability has been used extensively as a de facto performance criterion for evaluating parallel algorithms and architectures. However, for many, scalability has theoretical interests only since it does not reveal execution time. In this paper, the relation between scalability and execution time
Predicting MPEG Execution Times
, 1998
"... This paper reports on a set of experiments that measure the amount of CPU processing needed to decode MPEGcompressed video in software. These experiments were designed to discover indicators that could be used to predict how many cycles are required to decode a given frame. Such predictors can be us ..."
Abstract
-
Cited by 72 (4 self)
- Add to MetaCart
be used to do more accurate CPU scheduling. We found that by considering both frame type and size, it is possible to construct a linear model of MPEG decoding with R 2 values of 0.97 and higher. Moreover, this model can be used to predict decoding times at both the frame and packet level that are almost
Execution Time Monitoring in Linux *
"... Abstract This paper presents an implementation of an Execution Time Monitor (ETM) which can be applied in a resource management framework, such as the one proposed in the Open Media Platform (OMP) ..."
Abstract
-
Cited by 2 (1 self)
- Add to MetaCart
Abstract This paper presents an implementation of an Execution Time Monitor (ETM) which can be applied in a resource management framework, such as the one proposed in the Open Media Platform (OMP)
Determining Bounds on Execution Times
"... Run-time guarantees play an important role in the area of embedded systems and especially hard real-time systems. These systems are typically subject to stringent timing constraints, which often result from the interaction with the surrounding physical environment. It is essential that the computati ..."
Abstract
-
Cited by 17 (3 self)
- Add to MetaCart
that the computations are completed within their associated time bounds; otherwise severe damages may result, or the system may be unusable. Therefore, a schedulability analysis has to be performed which guarantees that all timing constraints will be met. Schedulability analyses require upper bounds for the execution
What to Communicate? Execution-time
"... this paper, we address the question of what to communicate. We describe two paradigms for representing limitations on communication and present an algorithm that enables multi-agent teams to make execution-time decisions on how to e#ectively utilize available communication resources ..."
Abstract
- Add to MetaCart
this paper, we address the question of what to communicate. We describe two paradigms for representing limitations on communication and present an algorithm that enables multi-agent teams to make execution-time decisions on how to e#ectively utilize available communication resources
Variability of Execution Times
"... ¢ predictable = adjective, able to be predicted ¢ to predict = verb, state that a specified event will happen in the future Fuzzy term in the WCET community. May refer to the ability to predict: ¢ the WCET precisely, ¢ the execution time precisely, ¢ the WCET efficiently. Notion of Predict ..."
Abstract
- Add to MetaCart
¢ predictable = adjective, able to be predicted ¢ to predict = verb, state that a specified event will happen in the future Fuzzy term in the WCET community. May refer to the ability to predict: ¢ the WCET precisely, ¢ the execution time precisely, ¢ the WCET efficiently. Notion
Timing-Sync Protocol for Sensor Networks
- The First ACM Conference on Embedded Networked Sensor System (SenSys
, 2003
"... Wireless ad-hoc sensor networks have emerged as an interesting and important research area in the last few years. The applications envisioned for such networks require collaborative execution of a distributed task amongst a large set of sensor nodes. This is realized by exchanging messages that are ..."
Abstract
-
Cited by 515 (8 self)
- Add to MetaCart
Wireless ad-hoc sensor networks have emerged as an interesting and important research area in the last few years. The applications envisioned for such networks require collaborative execution of a distributed task amongst a large set of sensor nodes. This is realized by exchanging messages
Uniform Execution Times
, 10
"... f their execution time on non-local references. Anal- ogous results for UMA multiprocessors [6] suggest that applications spend 20-30% of their time on cache misses. These percentages will vary depending on the scheduling policy; Gaussian elimination spends 33% of its execution time on non-local ref ..."
Abstract
- Add to MetaCart
f their execution time on non-local references. Anal- ogous results for UMA multiprocessors [6] suggest that applications spend 20-30% of their time on cache misses. These percentages will vary depending on the scheduling policy; Gaussian elimination spends 33% of its execution time on non
Results 1 - 10
of
38,288