Reworking in developing software exists widely in IT project management. But the current estimating methods on project duration cannot deal well with this problem. In this paper, some key concepts, such as adjusted activity, adjusted GERT network, expected project duration, expected critical path, are firstly defined. Then authors study estimating method on project duration for different rework...

| The reduction of power consumption for a system level pipeline is addressed in this paper. The pipeline is composed of several stages. Each stage has several behaviours. Di erent behaviours have di ering execution times. The speed of the pipeline is only a ected by the behaviours on the critical path of the slowest stages. Other behaviours can be slowed down to decrease the power consumed in ...

The notions of the critical path of events and critical time of an event are key concepts in analyzing the performance of a parallel discrete event simulation. The highest critical time of any event in a simulation is a lower bound on the time it takes to execute a simulation using any conservative simulation mechanism, and is also a lower bound on the time taken by some optimistic methods. How...

This paper is an introduction to the problem of Critical Path determination in the context of Timing Veriication. After correct logic veriication, timing is the next most important concern to be addressed by designers. The speed of a circuit is related to the length of the longest path through which a signal can travel, also known as the longest true path or critical path of the circuit. This p...

Critical sections are well known potential performance bottlenecks in multithreaded applications and identifying the ones that inhibit scalability are important for performance optimizations. While previous approaches use idle time as a key measure, we show such a measure is not reliable. The reason is that idleness does not necessarily mean the critical section is on the critical path. We intr...

Modern processors come close to executing as fast as true dependencies allow. The particular dependencies that constrain execution speed constitute the critical path of execution. To optimize the performance of the processor, we either have to reduce the critical path or execute it more efficiently. In both cases, it can be done more effectively if we know the actual path. This paper describes ...

In Wireless Sensor Networks, data collection by the Mobile Sink (MS) from the sensor nodes is a challenging task. In the proposed approach, the MS visits an optimal set of subsinks in order to collect data instead of visiting all the nodes in the network. In this paper, the subsink selection has been proven to be optimal since the subsinks are chosen by the Critical Path Method (CPM). Initially...

In this paper critical path analysis is used for predicting the behavior of conservative cellular network simulation on a distributed simulation environment. Parallel event traces, i.e. event traces that contain both real and null messages, are used for the analysis. A receive-process-send approach is proposed for computing the event execution times required by the critical path analysis. A pro...