Many monitoring and diagnosis systems have been proposed based on causal tracing for end-to-end executions in distributed systems as more and more modern computer applications become distributed systems. These applications are based on metadata propagation along the request’s executions, which has been closely tied to the application logic, the metadata formats, and the developer APIs. Such kin...

We present a compile time list heuristic scheduling algorithm called Low Cost Critical Path algorithm (LCCP) for the distributed memory systems. LCCP has low scheduling cost for both homogeneous and heterogeneous systems. In some recent papers list heuristic scheduling algorithms keep their scheduling cost low by using a fixed size heap and a FIFO, where the heap always keeps fixed number of ta...

In this paper, a practical method is developed in an attempt to address the fundamental matters and limitations of existing methods for critical-path method ~CPM! based resource scheduling, which are identified by reviewing the prior research in resourceconstrained CPM scheduling and repetitive scheduling. The proposed method is called the resource-activity critical-path method ~RACPM!, in whic...

This paper evaluates the delay of the issue queue in a superscalar processor to aid microarchitectural design, where quick quantification of the complexity of the issue queue is needed to consider the tradeoff between clock cycle time and instructions per cycle. Our study covers two aspects. First, we introduce banking tag RAM, which comprises the issue queue, to reduce the delay. Unlike normal...

In previous reports a compile-time prediction technique has been introduced that yields lowcost, highly parameterized performance models, to be used during the initial optimization loops in parallel system design. Aimed to provide an acceptable accuracy in the face of resource contention the approach is based on a combination of asymptotic bounding analysis and critical path analysis, yielding ...

The critical path of a group of tasks is an important measure that is commonly used to guide task allocation and scheduling on parallel computers. The critical path is the longest chain of dependencies in an acyclic task dependence graph. A problem arises on heterogeneous parallel machines where computation and communication costs can vary between different types of processor. Existing solution...

Algorithms come with multiple variants which are obtained by changing the mathematical approach from which the algorithm is derived. These variants offer a wide spectrum of performance when implemented on a multicore platform and we seek to understand these differences in performances from a theoretical point of view. To that aim, we derive and present the critical path lengths of each algorith...

Critical path analysis and percolation theory are known to predict accurately dc and low frequency ac electrical conductivity in strongly heterogeneous solids, and have some applications in statistics. Much of this work is dedicated to review the current state of these theories. Application to heterogeneous porous media has been slower, though the concept of percolation was invented in that con...