Results 1  10
of
793,040
Heuristic algorithms for scheduling independent tasks on nonidentical processors
 Journal of the ACM
, 1977
"... ABSTRACt. The finishing time properties of several heuristic algorithms for scheduhng n independent tasks on m nonidentical processors are studied In particular, for m = 2 an n log n timebounded algorithm is given which generates a schedule having a fimshmg Ume of at most (.,/5 + 1)/2 of the optima ..."
Abstract

Cited by 247 (0 self)
 Add to MetaCart
ABSTRACt. The finishing time properties of several heuristic algorithms for scheduhng n independent tasks on m nonidentical processors are studied In particular, for m = 2 an n log n timebounded algorithm is given which generates a schedule having a fimshmg Ume of at most (.,/5 + 1
Dynamic Mapping of a Class of Independent Tasks onto Heterogeneous Computing Systems
 Journal of Parallel and Distributed Computing
, 1999
"... This paper describes and compares eight heuristics that can be used in such an RMS for dynamically assigning independent tasks to machines ..."
Abstract

Cited by 213 (53 self)
 Add to MetaCart
This paper describes and compares eight heuristics that can be used in such an RMS for dynamically assigning independent tasks to machines
A Comparison of Eleven Static Heuristics for Mapping a Class of Independent Tasks onto Heterogeneous Distributed Computing Systems
, 2001
"... this paper is organized as follows. Section 2 defines the computational environment parameters that were varied in the simulations. Descriptions of the 11 mapping heuristics are found in Section 3. Section 4 examines selected results from the simulation study. A list of implementation parameters and ..."
Abstract

Cited by 337 (55 self)
 Add to MetaCart
this paper is organized as follows. Section 2 defines the computational environment parameters that were varied in the simulations. Descriptions of the 11 mapping heuristics are found in Section 3. Section 4 examines selected results from the simulation study. A list of implementation parameters and procedures that could be varied for each heuristic is presented in Section 5
Scheduling Independent Tasks with Voltage
"... Abstract: In this paper, we discuss several scheduling algorithms to execute independent tasks with voltage overscaling. Given a frequency to execute the tasks, operating at a voltage below threshold leads to significant energy savings but also induces timing errors. A verification mechanism must b ..."
Abstract
 Add to MetaCart
Abstract: In this paper, we discuss several scheduling algorithms to execute independent tasks with voltage overscaling. Given a frequency to execute the tasks, operating at a voltage below threshold leads to significant energy savings but also induces timing errors. A verification mechanism must
Allocating Independent Tasks
, 1997
"... One of the most important problems in the efficient use of parallel systems is to distribute the workload evenly among the servers. An instance of this problem is the problem of independent allocations where the tasks can be executed independently. This paper presents an overview on some results obt ..."
Abstract
 Add to MetaCart
One of the most important problems in the efficient use of parallel systems is to distribute the workload evenly among the servers. An instance of this problem is the problem of independent allocations where the tasks can be executed independently. This paper presents an overview on some results
An Approximate Algorithm for the Partitionable Independent Task Scheduling Problem
 University of Illinois, Urbana
, 1990
"... Scheduling a collection of tasks on a multiprocessor, consisting of p processors, that minimizes the maximum completion time has attracted a lot of attention in the literature [12]. In this paper, we introduce a new problem of scheduling a collection of independent tasks on a multiprocessor, called ..."
Abstract

Cited by 38 (6 self)
 Add to MetaCart
Scheduling a collection of tasks on a multiprocessor, consisting of p processors, that minimizes the maximum completion time has attracted a lot of attention in the literature [12]. In this paper, we introduce a new problem of scheduling a collection of independent tasks on a multiprocessor, called
On the use of independent tasks for face recognition
 In Proc. IEEE Conference on Pattern Recognition and Computer Vision (CVPR), Anchorage (AK
, 2008
"... We present a method for learning discriminative linear feature extraction using independent tasks. More concretely, given a target classification task, we consider a complementary classification task that is independent of the target one. For example, in face classification field, subject recognitio ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
We present a method for learning discriminative linear feature extraction using independent tasks. More concretely, given a target classification task, we consider a complementary classification task that is independent of the target one. For example, in face classification field, subject
Tuning of Algorithms for Independent Task Placement in the . . .
 EUROGRAPHICS SYMPOSIUM ON PARALLEL GRAPHICS AND VISUALIZATION (2004)
, 2004
"... This paper investigates assignment strategies (load balancing algorithms) for process farms which solve the problem of online placement of a constant number of independent tasks with given, but unknown, time complexities onto a homogeneous network of processors with a given latency. Results for the ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
This paper investigates assignment strategies (load balancing algorithms) for process farms which solve the problem of online placement of a constant number of independent tasks with given, but unknown, time complexities onto a homogeneous network of processors with a given latency. Results
Scheduling Independent Tasks on Metacomputing Systems
 in Proceedings of Parallel and Distributed Computing Systems
, 1999
"... Metacomputing is a convenient and powerful abstraction for dealing with the complexities that arise when managing and using a large collection of heterogeneous computational resources. One of the most fundamental characteristics of a metacomputing system is the algorithm it uses for the scheduling p ..."
Abstract

Cited by 30 (0 self)
 Add to MetaCart
Metacomputing is a convenient and powerful abstraction for dealing with the complexities that arise when managing and using a large collection of heterogeneous computational resources. One of the most fundamental characteristics of a metacomputing system is the algorithm it uses for the scheduling placement of jobs on processing nodes. We describe five schedule placement algorithms, and report on their success and failure modes when used to schedule job distributions. We investigate five different distributions of job execution time and the effects of predictability on the algorithms' performance. Our objective in this work is to develop a hierarchical scheduling model for large scale job management in a metacomputing system. We investigate the use of a gateway model for controlling job placement on subclusters of a larger cluster of resources. Keywords: metacomputing; scheduling; cluster computing; adaptive scheduling. 1 Introduction The term metacomputer was coined by Fox [4] to d...
BandwidthCentric Allocation of Independent Tasks on Heterogeneous Platforms
 In International Parallel and Distributed Processing Symposium (IPDPS’2002). IEEE Computer
, 2001
"... In this paper, we consider the problem of allocating a large number of independent, equalsized tasks to a heterogenerous "grid" computing platform. Such problems arise in collaborative computing eorts like SETI@home. We use a tree to model a grid, where resources can have dierent speeds ..."
Abstract

Cited by 84 (28 self)
 Add to MetaCart
In this paper, we consider the problem of allocating a large number of independent, equalsized tasks to a heterogenerous "grid" computing platform. Such problems arise in collaborative computing eorts like SETI@home. We use a tree to model a grid, where resources can have dierent
Results 1  10
of
793,040