Multiprocessor tasks require more than one processor at the same moment of time. This
relatively new concept in scheduling theory emerged with the advent of parallel computing …

We describe LLVM (low level virtual machine), a compiler framework designed to support
transparent, lifelong program analysis and transformation for arbitrary programs, by …

Standard presentation systems consisting of a laptop connected to a projector suffer from
two problems:(1) the projected image appears distorted (keystoned) unless the projector is …

Overheads due to synchronisation and loop scheduling are an important factor in
determining the performance of shared memory parallel programs. We present set of …

Load balancing involves assigning to each processor work proportional to its performance,
minimizing the execution time of the program. Although static load balancing can solve …

This paper presents novel compiler optimizations for reducing synchronization overhead in
compiler-parallelized scientific codes. A hybrid programming model is employed to combine …

Presents parallel algorithms for building decision-tree classifiers on shared-memory
multiprocessor (SMP) systems. The proposed algorithms span the gamut of data and task …

Scheduling in the context of parallel systems is often thought of in terms of assigning tasks in
a program to processors, so as to minimize the makespan. This formulation assumes that the …

Contemporary computer systems are multiprocessor or multicomputer machines. Their e
ciency depends on good methods of administering the executed works. Fast processing of a …

We explore several parallel implementations of an elasto-viscoplastic fast Fourier transform
(EVPFFT) model using Message Passing Interface (MPI), OpenMP, and a hybrid of MPI and …