scispace - formally typeset
Search or ask a question

Showing papers by "Massoud Pedram published in 1999"


Proceedings ArticleDOI
01 Jun 1999
TL;DR: A continuous-time, controllable Markov process model of a power-managed system that captures dependencies between the service queue and service provider status and the resulting power management policy is asynchronous, hence it is more power-efficient and more useful in practice.
Abstract: This paper introduces a continuous-time, controllable Markov process model of a power-managed system. The system model is composed of the corresponding stochastic models of the service queue and the service provider. The system environment is modeled by a stochastic service request process. The problem of dynamic power management in such a system is formulated as a policy optimization problem and solved using an efficient "policy iteration" algorithm. Compared to previous work on dynamic power management, our formulation allows better modeling of the various system components, the power-managed system as a whole, and its environment. In addition it captures dependencies between the service queue and service provider status. Finally, the resulting power management policy is asynchronous, hence it is more power-efficient and more useful in practice. Experimental results demonstrate the effectiveness of our policy optimization algorithm compared to a number of heuristic (time-out and N-policy) algorithms.

216 citations


Proceedings ArticleDOI
01 Jun 1999
TL;DR: Analytical derivations and experimental results underline the importance of the correct modeling of the battery-hardware system as a whole and provide a more accurate basis for comparing various low power optimization methodologies and techniques targeted toward battery-powered electronics.
Abstract: In this paper, we consider the problem of maximizing the battery life (or duration of service) in battery-powered CMOS circuits. We first show that the battery efficiency (or utilization factor) decreases as the average discharge current from the battery increases. The implication is that the battery life is a super-linear function of the average discharge current. Next we show that even when the average discharge current remains the same, different discharge current profiles (distributions) may result in very different battery lifetimes. In particular, the maximum battery life is achieved when the variance of the discharge current distribution is minimized. Analytical derivations and experimental results underline the importance of the correct modeling of the battery-hardware system as a whole and provide a more accurate basis (i.e., the battery discharge times delay product) for comparing various low power optimization methodologies and techniques targeted toward battery-powered electronics. Finally, we calculate the optimal value of V/sub dd/ for a battery-powered VLSI circuit so as to minimize the product of the battery discharge times the circuit delay.

183 citations


Proceedings ArticleDOI
17 Aug 1999
TL;DR: Experimental results show that power management method based on Markov decision process outperforms heuristic approaches in terms of power dissipation savings for a given level of system performance.
Abstract: The goal of a dynamic power management policy is to reduce the power consumption of an electronic system by putting system components into different states, each representing certain performance and power consumption level. The policy determines the type and timing of these transitions based on the system history, workload and performance constraints. In this paper we propose a new abstract model of a power-managed electronic system. We formulate the problem of system-level power management as a controlled optimization problem based on the theories of continuous-time Markov decision processes and stochastic networks. This problem is solved exactly and efficiently using a "policy iteration" approach. Our method is compared with existing heuristic approaches for different workload statistics. Experimental results show that power management method based on Markov decision process outperforms heuristic approaches in terms of power dissipation savings for a given level of system performance.

93 citations


Proceedings ArticleDOI
01 Jan 1999
TL;DR: Analytical derivations as well as experimental results demonstrate the importance of correct modeling of the battery-hardware system as a whole and provide a more accurate basis for comparing various low power optimization methodologies and techniques targeted toward battery-powered electronics.
Abstract: In this paper we study tradeoffs between energy dissipation and delay in battery-powered digital CMOS designs. In contrast to previous work, we adopt an integrated model of the VLSI circuit and the battery sub-system that powers it. We show that accounting for the dependence of battery capacity on the average discharge current changes shape of the energy-delay trade-off curve and hence the value of the operating voltage that results in the optimum energy-delay product for the target circuit. Analytical derivations as well as experimental results demonstrate the importance of correct modeling of the battery-hardware system as a whole and provide a more accurate basis for comparing various low power optimization methodologies and techniques targeted toward battery-powered electronics.

48 citations


Journal ArticleDOI
TL;DR: This paper introduces the hierarchical modeling of Markov chains as a flexible framework for capturing not only complex spatiotemporal correlations, but also dynamic changes in the sequence characteristics and introduces and characterize a family of variable-order dynamic Markov models which provide an effective way for accurate modeling of external input sequences that affect the behavior of finite state machines.
Abstract: Power estimation has become a critical step in the design of today's integrated circuits (ICs). Power dissipation is strongly input pattern dependent and, hence, to obtain accurate power values one has to simulate the circuit with a large number of vectors that typify the application data. The goal of this paper is to present an effective and robust technique for compacting large sequences of input vectors into much smaller ones such that the power estimates are as accurate as possible and the simulation time is reduced by orders of magnitude. Specifically, this paper introduces the hierarchical modeling of Markov chains as a flexible framework for capturing not only complex spatiotemporal correlations, but also dynamic changes in the sequence characteristics. In addition to this, we introduce and characterize a family of variable-order dynamic Markov models which provide an effective way for accurate modeling of external input sequences that affect the behavior of finite state machines. The new framework is very effective and has a high degree of adaptability. As the experimental results show, large compaction ratios of orders of magnitude can be obtained without significant loss in accuracy (less than 5% on average) for power estimates.

39 citations


Proceedings ArticleDOI
07 Nov 1999
TL;DR: An algorithm for simultaneous logic restructuring and placement is presented that first constructs a set of super-cells along the critical paths and then generates the set of non-inferior re-mapping solutions for each super-cell.
Abstract: In this paper, an algorithm for simultaneous logic restructuring and placement is presented. This algorithm first constructs a set of super-cells along the critical paths and then generates the set of non-inferior re-mapping solutions for each supercell. The best mapping and placement solutions for all super-cells are obtained by solving a generalized geometric programming (GGP) problem. The process of identifying and optimizing the critical paths is iterated until timing closure is achieved. Experimental results on a set of MCNC benchmarks demonstrate the effectiveness of our algorithm.

28 citations


Proceedings ArticleDOI
07 Nov 1999
TL;DR: LEOPARD is a fanout optimization algorithm based on the effort delay model for near-continuous size buffer libraries that minimizes area under required timing and input capacitance constraints by finding the tree topology and assigning different gains to each buffer to minimize the total buffer area.
Abstract: We present LEOPARD, a fanout optimization algorithm based on the effort delay model for near-continuous size buffer libraries. Our algorithm minimizes area under required timing and input capacitance constraints by finding the tree topology and assigning different gains to each buffer to minimize the total buffer area. Experimental results show that the new algorithm achieves significant buffer area improvement compared to previous approaches.

25 citations


BookDOI
01 Jul 1999
TL;DR: This book focuses on power macro-modeling based on regression analysis and power minimization through behavioral transformations, scheduling, resource assignment and hardware/software partitioning and mapping.
Abstract: From the Publisher: Power Optimization and Synthesis at Behavioral and System Levels Using Formal Methods was written to address some of the key problems in power analysis and optimization early in the design process. In particular, this book focuses on power macro-modeling based on regression analysis and power minimization through behavioral transformations, scheduling, resource assignment and hardware/software partitioning and mapping. What differentiates this book from other published work on the subject is the mathematical basis and formalism behind the algorithms and the optimality of these algorithms subject to the stated assumptions.

19 citations


Proceedings ArticleDOI
01 Jun 1999
TL;DR: This method finds the best solution of the problem of performance-driven buffered routing tree generation in electronic circuits in an exponential size solution subspace in polynomial time using a novel bottom-up construction algorithm and a local neighborhood search strategy.
Abstract: This paper presents a solution to the problem of performance-driven buffered routing tree generation in electronic circuits Using a novel bottom-up construction algorithm and a local neighborhood search strategy, this method finds the best solution of the problem in an exponential size solution subspace in polynomial time The output is a hierarchical buffered rectilinear Steiner routing tree that connects the driver of a net to its sink nodes The two variants of the problem, ie maximizing the driver required time subject to a total buffer area constraint and minimizing the total buffer area subject to a minimum driver required time constraint, are handled by propagating three-dimensional solution curves during the construction phase Experimental results prove the effectiveness of this technique compared to the other solutions for this problem

10 citations


Proceedings ArticleDOI
18 Jan 1999
TL;DR: It is demonstrated that the battery life decreases super-linearly as the average current dissipation increases, and the implications are far-reaching and change perceptions about low power design techniques targeted toward battery-powered VLSI circuits.
Abstract: We describe an integrated model of the hardware and the battery sub-systems in battery-powered VLSI systems. We demonstrate that, under this model and for a fixed operating voltage, the battery life decreases super-linearly as the average current dissipation increases. With the aid of analyses and empirical studies, we then show that the implications of this phenomenon are far-reaching and change our perceptions about low power design techniques targeted toward battery-powered VLSI circuits.

7 citations


Proceedings ArticleDOI
12 Apr 1999
TL;DR: An algorithm for gate sizing with controlled displacement to improve the overall circuit timing and iteratively identify and optimize the k-most critical paths in the circuit and their neighboring cells is presented.
Abstract: In this paper, we present an algorithm for gate sizing with controlled displacement to improve the overall circuit timing. We use a path-based delay model to capture the timing constraints in the circuit. To reduce the problem size and improve the solution convergence, we iteratively identify and optimize the k-most critical paths in the circuit and their neighboring cells. All the operations are formulated and solved as mathematical programming problems by using efficient solution techniques. Experimental results on a set of benchmark circuits demonstrate the effectiveness of our approach compared to the conventional approaches, which separate gate sizing from gate placement.

Journal ArticleDOI
TL;DR: An accurate model and procedures for predicting the common physical design characteristics of standard cell layouts (i.e., the interconnection length and the chip area) are presented.
Abstract: We present an accurate model and procedures for predicting the common physical design characteristics of standard cell layouts (i.e., the interconnection length and the chip area). The predicted results are obtained from analysis of the net list only, that is, no prior knowledge of the functionality of the design is used. Random and optimized placements, global routing, and detailed routing are each abstracted by procedural models that capture the important features of these processes, and closed-form expressions that define these procedural models are presented. We have verified both the global characteristics (total interconnection length and layout area) and the detailed characteristics (wire length and feedthrough distributions) of the model. On the designs in our test suite, the estimates are very close to the actual layouts.

Book ChapterDOI
01 Jan 1999
TL;DR: A number of researches have addressed the problem of minimizing power dissipation during module allocation and binding through pipelining or parallelization combined with voltage scaling.
Abstract: A number of researches have addressed the problem of minimizing power dissipation during module allocation and binding [RJ94] [KC97], scheduling and allocation [MC95], register allocation and binding [RJ94] [CP95a] and trading area for lower power through pipelining or parallelization combined with voltage scaling [GOC94] [CPRR92], scheduling using multiple supply voltages [CP96a, CP97] [RS95] [JR96].

Proceedings ArticleDOI
17 Aug 1999
TL;DR: The transitive closure calculation is used to identify the transient component in the behavior of the target machine and then, based on the fundamental matrix and a symbolic approach, the actual power distribution that corresponds to the transient regime is found.
Abstract: The objective of this paper is to present an analytic technique for power analysis under non-stationary conditions. We use the transitive closure calculation to identify the transient component in the behavior of the target machine and then, based on the fundamental matrix and a symbolic approach (or support from simulation), we find the actual power distribution that corresponds to the transient regime. The present technique complements the current techniques (either for average or peak power estimation) to handle the case when transient effects exist and cannot be ignored.

Journal ArticleDOI
TL;DR: This paper presents a synthesis methodology for ECL circuits based on a mixed voltage-current signal representation and operation defined on the voltage and current signals and concludes by presenting an algebraic system which is suitable for current signal Representation and operation on currents.
Abstract: This paper presents a synthesis methodology for ECL circuits based on a mixed voltage-current signal representation and operation defined on the voltage and current signals. The ideas presented in this paper are then demonstrated on the design of an ECL 1-bit full adder. The paper concludes by presenting an algebraic system which is suitable for current signal representation and operation on currents.