نتایج جستجو برای: most critical path

تعداد نتایج: 1975670  

2012
David Defour

This paper addresses the issue of collapsing dependent floatingpoint operations. The presentation focuses on studying the dataflow graph of benchmark involving a large number of floating-point instructions. In particular, it focuses on the relevance of new floating-point operators performing two dependent operations which are similar to “fused multiply and add”. Finally, this paper examines the...

2004
Seongmoo Heo Krste Asanović

Digital circuits often have a critical path that runs through a small subset of the component subblocks, but where the path changes dynamically during operation. Dynamically resizable static CMOS (DRCMOS) logic is proposed as a fine-grain leakage reduction technique that dynamically downsizes transistors in inactive subblocks while maintaining speed in subblocks along the current critical path....

2012
Michael Reeves

Determining the means by which an attacker may compromise a given system is the main purpose of vulnerability assessment. As such, there are several models currently in place to track vulnerabilities. Some models focus on the susceptibility of a computer system as a whole where other models track attack paths through a network. This paper proposes a model which accomplishes both. The primary fo...

2008
Abhishek Tiwari Josep Torrellas

Process variation reduces a pipeline’s maximum attainable frequency by creating unbalance in the stage delays. As a result, the pipeline ends up cycling with a period close to that of the slowest pipeline stage. ReCycle was proposed in ISCA 2007 as a framework for comprehensively applying cycle time stealing to balance the stage delays under process variation, thereby allowing the pipeline to c...

2015
Kanu Priya

Abstract:The VLSI design industry has grown rapidly during the last few decades. The complexity of the applications increases day by day due to which the area utilization increases. The tradeoff between area and speed is an important factor. The main focus of continued research has been to increase the operating speed by keeping the area and memory utilization of the design as low as possible. ...

2006
DOMINIC BURNS JOHN HOPKINSON

Leapfrog Technology is defined within this project as a holistic, cost effective approach to combining and applying innovative yet simple products and processes concurrently throughout various departments including engineering, fabrication shops, and production stages of construction. The present technology for designing, manufacturing, and installing equipment foundations and systems is labor ...

Journal: :International Journal of Theoretical and Applied Finance 2018

Journal: :Big data and cognitive computing 2023

The Time-Period-Based Most Frequent Path (TPMFP) problem has been a hot topic in traffic studies for many years. TPMFP involves finding the most frequent path between two locations by observing travelling behaviors of drivers specific time period. However, previous researchers over-simplify road network, which results ignorance transfer costs at intersections. To address this more elegantly, we...

1994
Cedell Alexander Donna S. Reese James C. Harden

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 near–critical paths of program activity graphs are presented and compared, including an efficient new algorithm that utilizes...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید