This paper presents the design, implementation and testing of the critical path analysis technique on the IPS performance measurement tool for parallel and distributed programs. We create a precedence graph of a program’s activities (Program Activity Graph) with the data collected during the execution of a program. The critical path, the longest path in the program activity graph, represents th...

In Part I of this paper, a quasi-static experimental path-following method was developed that uses tangent quantities in feedback controller, based on Newton’s method. The ability to compute an stiffness opens the door more advanced techniques. Here, we extend to: (i) pinpointing critical points (limit and branching points); (ii) branch switching alternate equilibrium paths; (iii) tracing with ...

we consider biobjective shortest path problems in networks with fuzzy arc lengths. considering the available studies for single objective shortest path problems in fuzzy networks, using a distance function for comparison of fuzzy numbers, we propose three approaches for solving the biobjective prob- lems. the rst and second approaches are extensions of the labeling method to solve the sing...

In this paper, we propose alternate self shielding to remove critical transitions of on-chip global interconnect. Our proposed method alternates shield and signal wires cycle by cycle. The conventional self-shielding methods need additional wires to remove critical transition by encoding. The proposed alternate self-shielding, however, requires no additional wires. We evaluate our method by sim...

Shortest path problems are a well-studied class of problems in theoretical computer science. One particularly applicable type of shortest path problem is to find the geodesic shortest path on a terrain. This type of algorithm finds the shortest path between two points that stays on the surface of a terrain. The most popular methods for finding such a shortest path involve a variant of Dijkstra’...

Recently Chu, Liu, and Mehrmann developed an O(n3) structure preserving method for computing the Hamiltonian real Schur form of a Hamiltonian matrix. This paper outlines an alternate derivation of the method and alternate explanation of why the method works. Our approach places emphasis eigenvalue swapping and relies less on matrix manipulations.

In both classical and quantum mechanics, a dynamical system with symmetry is reduced to a system which has a smaller number of degrees of freedom. In this paper we formulate path integrals for the quantum system reduced by symmetry. The original system is defined in terms of a Riemannian manifold M , on which a Lie group G acts by isometric transformations. Then we show that the path integral o...

The paper presents a novel approach to the decentralized task assignment for multiple cooperative unmanned air systems, in a multiple target-multiple task environment. The vehicles (or agents) may have complete or partial a priori information about the targets that populate the scenario. Each vehicle autonomously computes the cost for servicing each task available at each target using a path pl...