Static scheduling of a program represented by a directed task graph on a multiprocessor
system to minimize the program completion time is a well-known problem in parallel …

Modern science often requires the execution of large-scale, multi-stage simulation and data
analysis pipelines to enable the study of complex systems. The amount of computation and …

To program in distributed computing environments such as grids and clouds, workflow is
adopted as an attractive paradigm for its powerful ability in expressing a wide range of …

The past decade has seen significant progress in characterizing uncertainty in
environmental systems models, through statistical treatment of incomplete knowledge …

A flexible microactuator (FMA) driven by an electropneumatic (or electrohydraulic) system
has been developed. The FMA has three degrees of freedom, pitch, yaw, and stretch, and …

We present a low-complexity heuristic, named the dominant sequence clustering algorithm
(DSC), for scheduling parallel tasks on an unbounded number of completely connected …

A new model for task scheduling that dramatically improves the efficiency of parallel systems
Task scheduling for parallel systems can become a quagmire of heuristics, models, and …

Clustering of task graphs has been used as an intermediate step toward scheduling parallel
architectures. In this paper, we identify important characteristics of clustering algorithms and …

Servitization of manufacturing has become one of the main pathways for transition and
upgrade in the manufacturing industry. New information and communication technologies …

Future requirements for computing speed, system reliability, and cost-effectiveness entail the
development of alternative computers to replace the traditional von Neumann organization …