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

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

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

rails fracture by the growth of fatigue crack or critical crack is one of the prevalent defects in railway. the rail fracture, failure and stress analysis should be studied in order to prevention of rail fracture. in this paper, new formulation of contact stress for two rolling bodies is presented, where the results are closed to the hertz stress formulation. moreover, stress analysis is done b...

Problem (JSSP) to evaluate the neighborhoods functions that use the non-deterministic algorithms is the calculation of the critical path in a digraph. This paper presents an experimental study of the cost of computation that exists when the calculation of the critical path in the solution for instances in which a JSSP of large size is involved. The results indicate that if the critical path is ...

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 fulfill since many of activities will...

This paper presents an algorithm to heuristically partition the data dependence graph representing a basic block or a hyper block of code in order to assign instructions to available processing cores. The algorithm relies on the observation that the critical path in the data dependence graph defines the lower bound on the schedule length of a block and hence the instructions on the critical pat...

In this paper, we introduce a runtime, nontrace-based algorithm to compute the critical path profile of the execution of message passing and shared-memory parallel programs. Our algorithm permits starting or stopping the critical path computation during program execution and reporting intermediate values. We also present an online algorithm to compute a variant of critical path, called critical...

-Cloud computing, as a new model of service provision in distributed computing environment, faces the great challenge of energy consumption because of its large demand for computing resources. Choosing improper scheduling method to execute cloud workflow tends to result in the waste of power consumption. In order to lower the higher power consumption for cloud workflow executing, we propose a p...