534 search results - page 31 / 107 » Diameter critical graphs |
ESCIENCE
2007
IEEE
14 years 4 months ago
2007
IEEE
Effective scheduling is a key concern for the execution of performance driven Grid applications. In this paper, we propose a Dynamic Critical Path (DCP) based workflow scheduling ...
ICCAD
2007
IEEE
14 years 6 months ago
2007
IEEE
— We present a new linear time technique to compute criticality information in a timing graph by dividing it into “zones”. Errors in using tightness probabilities for critica...
ASPDAC
2007
ACM
14 years 1 months ago
2007
ACM
Abstract-- In this paper we present the Statistical Retimingbased Timing Analysis (SRTA) algorithm. The goal is to compute the timing slack distribution for the nodes in the timing...
ICCD
2007
IEEE
14 years 1 months ago
2007
IEEE
While Speculative Multithreading (SM) on a Chip Multiprocessor (CMP) has the ability to speed-up hard-toparallelize applications, the power inefficiency of aggressive speculation ...
PRDC
2009
IEEE
14 years 4 months ago
2009
IEEE
—With ever-growing complexity of computer and communication systems analytical methods do not scale, especially with respect to dependability assessment of information technology...