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 …

Mixed-machine heterogeneous computing (HC) environments utilize a distributed suite of
different high-performance machines, interconnected with high-speed links, to perform …

Dynamic map** (matching and scheduling) heuristics for a class of independent tasks
using heterogeneous distributed computing systems are studied. Two types of map** …

As a result of advances in high-speed digital communications, researchers have begun to
use collections of different high-performance machines in concert to execute …

It is increasingly common for computer users to have access to several computers on a
network, and hence to be able to execute many of their tasks on any of several computers …

Computer architecture deals with the physical configuration, logical structure, formats,
protocols, and operational sequences for processing data, controlling the configuration, and …

To exploit a heterogeneous computing (HC) environment, an application task may be
decomposed into subtasks that have data dependencies. Subtask matching and scheduling …

Heterogeneous computing (HC) environments are well suited to meet the computational
demands of large, diverse groups of tasks (ie, a meta-task). The problem of map** …

Spatial Analysis: Modelling in a GIS Environment Edited by PaulLongley and Michael Batty
Digital data and information are usedincreasingly by academics, professionals, local …

In this paper, we present a game theoretic framework for obtaining a user-optimal load
balancing scheme in heterogeneous distributed systems. We formulate the static load …