This paper presents a highly efficient parallel particle–mesh (PPM) library, based on a
unifying particle formulation for the simulation of continuous systems. In this formulation, the …

In compile-time task scheduling for distributed-memory systems, list scheduling is generally
accepted as an attractive approach, since it pairs low cost with good results. List-scheduling …

Multiprocessor task scheduling is an important and computationally difficult problem. A large
number of algorithms were proposed which represent various tradeoffs between the quality …

This work presents a novel hybrid meta-heuristic that combines particle swarm optimization
and genetic algorithm (PSO–GA) for the job/tasks in the form of directed acyclic graph (DAG) …

In this paper we present a new multi-resolution parallel framework, which is designed for
large-scale SPH simulations of fluid dynamics. An adaptive rebalancing criterion and …

As high-performance computing moves to the petascale and beyond, a number of
algorithmic and software challenges need to be addressed. This paper reviews the main …

This paper introduces hybrid Petri nets into modeling for farm work flow in agricultural
production. The main emphasis is on the construction of an adequate model for designing …

We revise existing and introduce new mixed-integer programming models for the
Multiprocessor scheduling problem with communication delays. The basis for both is the …

In this paper we consider scheduling tasks on a multiprocessor system, taking into account
communication delays. We propose a new Mixed Integer Program (MIP) formulation that …

Multiprocessor task scheduling is one of the hardest combinatorial optimization problems in
parallel and distributed systems. It is known as NP-hard and therefore, scanning the whole …