Results 1  10
of
18
On the False Path Problem in Hard RealTime Programs
 In Proceedings of the 8th Euromicro Workshop on Realtime Systems
, 1996
"... This paper addresses the important subject of estimating the worstcase execution time (WCET) of hard realtime programs essentially needed for further evaluation of realtime systems. Purely structure oriented methods, analysing the control flow of the program without taking into account functional ..."
Abstract

Cited by 58 (8 self)
 Add to MetaCart
This paper addresses the important subject of estimating the worstcase execution time (WCET) of hard realtime programs essentially needed for further evaluation of realtime systems. Purely structure oriented methods, analysing the control flow of the program without taking into account functional dependencies, tend to overestimate the execution time. An exact solution of this NPcomplete problem is impossible for larger applications. In this paper, we propose a new heuristic of finding an estimate on the WCET. It provides a reasonable tradeoff between analysis results and analysis efforts: the results will still be better than purely structure oriented methods without spending too much time on finding an exact solution. For this purpose our approach does not need any user annotations except for maximum loop counts and maximum recursion depths. The actual algorithm combines pruned path enumeration with the concept of symbolic execution. 1. Introduction Predicting the execution times...
Fast statistical timing analysis handling arbitrary delay correlations
 in Proc. IEEE/ACM Design Autom. Conf
"... An efficient statistical timing analysis algorithm that can handle arbitrary (spatial and structural) causes of delay correlation is described. The algorithm derives the entire cumulative distribution function of the circuit delay using a new mathematical formulation. Spatial as well as structural c ..."
Abstract

Cited by 35 (3 self)
 Add to MetaCart
An efficient statistical timing analysis algorithm that can handle arbitrary (spatial and structural) causes of delay correlation is described. The algorithm derives the entire cumulative distribution function of the circuit delay using a new mathematical formulation. Spatial as well as structural correlations between gate and wire delays can be taken into account. The algorithm can handle node delays described by nonGaussian distributions. Because the analytical computation of an exact cumulative distribution function for a probabilistic graph with arbitrary distributions is infeasible, we find tight upper and lower bounds on the true cumulative distribution. An efficient algorithm to compute the bounds is based on a PERTlike single traversal of the subgraph containing the set of N deterministically longest paths. The efficiency and accuracy of the algorithm is demonstrated on a set of ISCASâ€™85 benchmarks. Across all the benchmarks, the average rms error between the exact distribution and lower bound is 0.7%, and the average maximum error at 95 th percentile is 0.6%. The computation of bounds for the largest benchmark takes 39 seconds.
Timing and Area Optimization for StandardCell VLSI Circuit Design
, 1995
"... A standard cell library typically contains several versions of any given gate type, each of which has a different gate size. We consider the problem of choosing optimal gate sizes from the library to minimize a cost function (such as total circuit area) while meeting the timing constraints imposed o ..."
Abstract

Cited by 16 (1 self)
 Add to MetaCart
A standard cell library typically contains several versions of any given gate type, each of which has a different gate size. We consider the problem of choosing optimal gate sizes from the library to minimize a cost function (such as total circuit area) while meeting the timing constraints imposed on the circuit. After
NearCritical Path Analysis of Program Activity Graphs
, 1994
"... Program activity graphs can be constructed from timestamped traces of appropriate execution events. Information about the activities on the k longest execution paths is useful in the analysis of parallel program performance. In this paper, four algorithms for finding the nearcritical paths of prog ..."
Abstract

Cited by 7 (3 self)
 Add to MetaCart
Program activity graphs can be constructed from timestamped traces of appropriate execution events. Information about the activities on the k longest execution paths is useful in the analysis of parallel program performance. In this paper, four algorithms for finding the nearcritical paths of program activity graphs are presented and compared, including an efficient new algorithm that utilizes slack values calculated by the critical path method to perform a bestfirst search in linear space. The worstcase time and memory requirements of the new algorithm are in O(ke) and O(k+e), where e is the number of edges in the graph. Results confirming the efficiency of the algorithm are presented for five application programs. A framework for utilizing the nearcritical path information is also described. The framework includes both statistical summaries and visualization capabilities. Index TermsCritical path, program activity graph, instrumentation, parallel program performance analy...
Distributed Eventdriven Simulation: Scheduling Strategies and Resource Management
, 2000
"... Optimistic parallel discrete event simulation method is applied to large scale data parallel applications. Specificly, optimizations for state saving of large state vectors and bounded optimism are incorporated in the simulation environment. Dynamic load balancing is studied, and a checkpoint and mi ..."
Abstract

Cited by 5 (1 self)
 Add to MetaCart
Optimistic parallel discrete event simulation method is applied to large scale data parallel applications. Specificly, optimizations for state saving of large state vectors and bounded optimism are incorporated in the simulation environment. Dynamic load balancing is studied, and a checkpoint and migration mechanism is implemented and integrated with the PVM message passing environment.
Delay and Area Optimization for Compact Placement by Gate Resizing and Relocation
 Proc. Intl. Conf. on CAD
, 1994
"... In this paper, we rst present an e cient algorithm for the gate sizing problem. Then we propose an algorithm which performs delay and area optimization for a given compact placement by resizing and relocating cells in the circuit layout. Since the gate sizing procedure isembedded within the placemen ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
In this paper, we rst present an e cient algorithm for the gate sizing problem. Then we propose an algorithm which performs delay and area optimization for a given compact placement by resizing and relocating cells in the circuit layout. Since the gate sizing procedure isembedded within the placement adjustment process, interconnect capacitance information is included in the gate size selection process. As aresult, the algorithm is able to obtain superior solutions. 1
On Performance and Area Optimization of VLSI Systems Using Genetic Algorithms
 VLSI Design
, 1995
"... A new performance and area optimization algorithm for complex VLSI systems is presented. It is widely believed within the VLSI CAD community that the relationship between delay and silicon area of a VLSI chip is convex. This conclusion is based on a simplified linear RC model to predict gate delays. ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
A new performance and area optimization algorithm for complex VLSI systems is presented. It is widely believed within the VLSI CAD community that the relationship between delay and silicon area of a VLSI chip is convex. This conclusion is based on a simplified linear RC model to predict gate delays. In the proposed optimization algorithm, a nonlinear, nonRC based transistor delay model was used which resulted in a nonconvex relationship between the delay and the silicon area of a VLSI chip. Genetic algorithms are better suited for discrete, nonconvex, nonlinear optimization problems than traditional calculusbased algorithms. By using the genetic algorithms in the performance and area optimization, we are able to find the optimal values for both delay and silicon area for the ISCAS benchmark circuits. Key Words: Area and Performance optimization; Transistor Sizing; Genetic algorithms 1 Introduction The techniques for performance and area optimization of VLSI systems can be divi...
Optimal Project Planning Through Feasible Path Analysis
, 1996
"... In this paper we present a powerful technique for analysing production networks in the presence of decisionmaking variables and cost flexibility. Processes are modelled as a network, similar to PERT/CPM schemes, but with builtin decision and cost variables. For minimal increased complexity in the ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
In this paper we present a powerful technique for analysing production networks in the presence of decisionmaking variables and cost flexibility. Processes are modelled as a network, similar to PERT/CPM schemes, but with builtin decision and cost variables. For minimal increased complexity in the development of the network, we show that powerful analysis and optimisation techniques are enabled. The concept of feasible paths is introduced as a key factor in the analysis and optimisation process. 1 INTRODUCTION Networkbased approaches, particularly techniques such as PERT/CPM, are still widely used for planning and control of large projects [1] [3] [9]. They are effective at showing the interrelationships of combined activities, and can allow approximations of processing times and critical paths in the project. However, they are poorly suited for modelling the interdependence of the many decisions which must be made during the project  even though the general "rules" for many decisi...
CIPDATA LIBRARY TECHNISCHE UNIVERSITEIT EINDHOVEN
"... Towards predictable deepsubmicron manufacturing ..."