The notion of the necessary criticality (both with respect to path and to activity) of a network with imprecisely defined (by means of intervals or fuzzy intervals) activity duration times is introduced and analyzed. It is shown, in the interval case, that both the problem of asserting whether a given path is necessarily critical and the problem of determining an arbitrary necessarily critical ...

In this paper, we focus on the problem of secure multicast in dynamic groups. In this problem, a group of users communicate using a shared group key. Due to the dynamic nature of these groups, to preserve secrecy, it is necessary to change the group key whenever the group membership changes. While the group key is being changed, the group communication needs to be interrupted until the rekeying...

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...

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....

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...

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...

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. ...

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 ...

A new method for finding fuzzy optimal solution, the maximum total completion fuzzy time and fuzzy critical path for the given fully fuzzy critical path (FFCP) problems using crisp linear programming (LP) problem is proposed. In this proposed method, all the parameters are represented by triangular fuzzy number. The fuzzy optimal solution of the FFCP problems obtained by the proposed method, do...

Multi-processor scheduling is an NP-hard problem, so heuristic solutions must be found. Several critical path heuristics have been proposed, but these must be empirically tested to see if their solutions are adequate. This paper examines the performance of four critical path heuristics and nds that they are unable to perform well on the types of graphs which are likely to be created by compiler...