In this paper, we model a research-and-development project as consisting of several modules, with each module containing one or more activities. We examine how to schedule the activities of such a project in order to maximize the expected profit when the activities have a probability of failure and when an activity’s failure can cause its module and thereby the overall project to fail. A module...

When a loop in a sequential program is parallelized, it is normally guaranteed that all ow dependencies and anti-dependencies are respected so that the result of parallel execution is always the same as sequential execution. In some cases, however, the algorithm implemented by the loop allows the iterations to be executed in a di erent sequential order than the one speci ed in the program. This...

Airborne Light Detection and Ranging (LiDAR) is widely used in digital elevation model (DEM) generation. However, the very large volume of LiDAR datasets brings a great challenge for the traditional serial algorithm. Using parallel computing to accelerate the efficiency of DEM generation from LiDAR points has been a hot topic in parallel geo-computing. Generally, most of the existing parallel a...

Parallel tempering (PT) methods are a popular class of Markov chain Monte Carlo schemes used to sample complex high-dimensional probability distributions. They rely on collection $N$ interacting auxiliary chains targeting tempered versions the target distribution improve exploration state-space. We provide here new perspective these highly parallel algorithms and their tuning by identifying for...

In Clustered Instruction-level Parallel (ILP) processors, the function units are partitioned and resources such as register file and cache are either partitioned or replicated and then grouped together into onchip clusters. We present a novel partitioned register file architecture for clustered ILP processors which exploits the temporal locality of references to remote registers in a cluster an...

In this paper, we present a scheme which explores the parallelism on JVM. An algorithm, called dynamic-duplication scheduling is developed for solving the static scheduling of DFG on the paralle JVM. Experimental results show that the schedule produced by such a parallel algorithm is significantly improved compared with the traditonal JVM.

Due to the development of management idea and the scarcity of some resources, the lean management has become the necessary request to implement effective control of resource constrained project. Resource constrained project scheduling is the significant guarantee to attain the lean management. The resource constrained project scheduling problem (RCPSP), with the objective of minimizing project ...