In this paper we present an algorithmic approach to packing A-paths. It is regarded as a generalization of Edmonds’ matching algorithm, however there is the significant difference that here we do not build up any kind of alternating tree. Instead we use the so-called 3-way lemma, which either provides augmentation, or a dual, or a subgraph which can be used for contraction. The method works in ...

In cases where usability is a mission critical system quality it is becoming essential to know whether an evaluation study has identified the majority of existing defects. Previous work has shown that procedures for estimating the progress of evaluation studies have to account for variation in defect visibility; otherwise, harmful bias will happen. Here, a statistical model is introduced for es...

The paper investigates the effects of technology scaling on area/delay characteristics of registertransfer level (RTL) designs. Based on experimental modeling of RTL components and interconnect, whose feature sizes have been scaled down from 1.5 m to 0.25 m, we evaluate the critical path delay and area of several data-paths and report on efficiency of layout and RTL optimization techniques at t...

The Critical Path Method (CPM) is useful for planning and control of complex projects. The CPM identifies the critical activities in the critical path of an activity network. The successful implementation of CPM requires the availability of clear determined time duration for each activity. However, in practical situations this requirement is usually hard to fulfil since many of activities will ...

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