Sciweavers

56 search results - page 9 / 12
» Precise Worst-Case Execution Time Analysis for Processors wi...
Sort
View
IPPS
2007
IEEE
14 years 2 months ago
Bi-criteria Scheduling Algorithm with Deployment in Cluster
Computational grids clusters, provide powerful computing resources for executing applications of large scale. In Grid (clusters) usually several applications run simultaneously.Th...
Feryal-Kamila Moulaï, Gregory Mounie
CASES
2009
ACM
14 years 3 months ago
Tight WCRT analysis of synchronous C programs
Accurate estimation of the tick length of a synchronous program is essential for efficient and predictable implementations that are devoid of timing faults. The techniques to dete...
Partha S. Roop, Sidharta Andalam, Reinhard von Han...
ICCAD
2001
IEEE
128views Hardware» more  ICCAD 2001»
14 years 5 months ago
An Assembly-Level Execution-Time Model for Pipelined Architectures
The aim of this work is to provide an elegant and accurate static execution timing model for 32-bit microprocessor instruction sets, covering also inter–instruction effects. Suc...
Giovanni Beltrame, Carlo Brandolese, William Forna...
SIROCCO
2000
13 years 10 months ago
Cooperative computing with fragmentable and mergeable groups
ABSTRACT: This work considers the problem of performing a set of N tasks on a set of P cooperating message-passing processors (P N). The processors use a group communication servi...
Chryssis Georgiou, Alexander A. Shvartsman
ICCSA
2004
Springer
14 years 1 months ago
Speculative Parallelization of a Randomized Incremental Convex Hull Algorithm
Finding the fastest algorithm to solve a problem is one of the main issues in Computational Geometry. Focusing only on worst case analysis or asymptotic computations leads to the d...
Marcelo H. Cintra, Diego R. Llanos Ferraris, Bel&e...