A procedure commonly used in Job Shop Scheduling 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. T...

We present a new approach to performing program analysis through profile-guided random generation of instruction traces. Using hardware support available in commercial processors, we profile the behavior of individual instructions. Then, in conjunction with the program binary, we use that information to fabricate short (1,000-instruction) traces by randomly evaluating branches in proportion to ...

A simulation approach is presented for planning and scheduling a flow of complex jobs for job shop like production systems. Machines may have their own specific restrictions and properties such as relative production speed, set up characteristics and scheduling rules. A production job consists of a set of tasks represented by a directed activity network in which an activity is defined as a sing...

An efficient method of parallel fault simulation for combinational circuits is proposed. The method is based on structurally synthesized BDDs (SSBDD) which allow to represent gate level circuits at higher macro level where macros represent subnetworks of gates. Converting the gate-level circuits to the macrolevel is accompanied with corresponding fault collapsing. A parallel fault analysis algo...

The purpose of the paper was to address the timeliness of the signaller's intervention in the Ladbroke Grove rail incident in the UK, as well as to consider the utility of human performance time modelling more generally. Human performance response time modelling is a critical area for Human Factors and Ergonomics research. This research applied two approaches to the same problem to see if they ...

In this paper we present an efficient algorithm for compile-time scheduling and clustering of parallel programs onto parallel processing systems with distributed memory, which is called The Dynamic Critical Path Scheduling DCPS. The DCPS is superior to several other algorithms from the literature in terms of computational complexity, processors consumption and solution quality. DCPS has a time ...

Recently, an approach using the discrete event paradigm for the simulation of continuous systems has been developed. This approach is based on the use of piecewise-linear approximations for the representation of continuous, time-varying quantities. The focus of this paper is to show how this new technique can be implemented on a multiprocessor. Our hypothesis is that the Time Warp algorithm is ...

A systematic procedure for locating resistive bridges is presented. Critical path tracing is used to identify a set of “suspect” bridges whose presence could explain all of the observed faulty behavior of the circuit for the original test set. The set of suspects is then reduced by adaptively applying additional tests derived from the failing vector pairs in the original test set. Unlike other ...