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

An algorithm for compile-time static scheduling of task graphs onto multiprocessors is proposed. The proposed algorithm, which is called Dynamic Critical Path (DCP) scheduling algorithm, is different from previously reported algorithms in a number of ways. First, it determines the critical path of the task graph and selects the next node to be scheduled in a dynamic fashion. Second, it rearrang...

It is shown first by Adleman that deoxyribonucleic acid (DNA) strands could be employed towards calculating solution to an instance of the NP-complete Hamiltonian Path Problem (HPP). Lipton also demonstrated that Adleman’s techniques could be used to solve the satisfiability (SAT) problem. In this paper, it is demonstrated how the DNA operations presented by Adleman and Lipton can be used to de...

Procedures for optimization and resource allocation in Operations Research first require a project network for the task to be specified. The specification of a project network is at present done in an intuitive way. AI work in plan formation has developed formalisms for specifying primitive activities, and recent work by Sacerdoti (1975a) has developed a planner able to generate a plan as a par...

In this paper, we propose a static scheduling algorithm for allocating task graphs to fullyconnected multiprocessors. We discuss six recently reported scheduling algorithms and show that they possess one drawback or the other which can lead to poor performance. The proposed algorithm, which is called the Dynamic Critical-Path (DCP) scheduling algorithm, is different from the previously proposed...

project scheduling inevitably involves uncertainty. The basic inputs (i.e., time, cost, and resources for each activity) are not deterministic and are affected by various sources of uncertainty. Moreover, there is a causal relationship between these uncertainty sources and project parameters; this causality is not modeled in current state-of-the-art project planning techniques {such as simulati...

Risk management is a process aimed at enhancement, developing the level of security in an organization. It gives the organization a broad view of the risks that can affect its productivity and performance, and enables it to make appropriate risk management decisions. This paper presents a new fuzzy method for measuring risk element criticality in a fuzzy project network. There have been several...

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