Academic
Publications
Scheduling with uncertainties on new computing platforms

Scheduling with uncertainties on new computing platforms,10.1007/s10589-009-9311-0,Computational Optimization and Applications,Amine Mahjoub,Johnatan

Scheduling with uncertainties on new computing platforms   (Citations: 4)
BibTex | RIS | RefWorks Download
New distributed computing platforms (grids) are based on interconnections of a large number of processing elements. A most important issue for their effective utilization is the optimal use of resources through proper task scheduling. It consists of allocating the tasks of a parallel program to processors on the platform and to determine at what time the tasks will start their execution. As data may be subject to uncertainties or disturbances, it is practically impossible to precisely predict the input parameters of the task scheduling problem. We briefly survey existing approaches for dealing with data uncertainties and discuss their relevance in the context of grid computing. We describe the stabilization process and analyze a scheduling algorithm that is intrinsically stable (i.e., it mitigates the effects of disturbances in input data at runtime). This algorithm is based on a decomposition of the application graph into convex sets of vertices. Finally, it is compared experimentally to pure on-line and well-known off-line algorithms.
Journal: Computational Optimization and Applications - COMPUT OPTIM APPL , vol. 48, no. 2, pp. 369-398, 2011
Cumulative Annual
View Publication
The following links allow you to view full publications. These links are maintained by other sources not affiliated with Microsoft Academic Search.
    • ...Task clustering is a technique that follows this idea [10, 11], and it is often used for scheduling tasks on an unlimited number of processors [12, 13, 14]...

    Mateusz Guzeket al. A Cellular Genetic Algorithm for scheduling applications and energy-aw...

    • ...For example, considering arbitrary time execution and large communication delay the authors in [11] showed that the convex clusterings are 3-Dominant...
    • ...Recently convex clusters have been investigated in the context of the scheduling problem with disturbances on the communication delays [11]...
    • ...In this context, the authors in [11] also showed that convex clusters are robust based on the stability criterion, that is convex clusters are intrinsically stable...
    • ...Based on this assumption the authors in [11] claimed that any convex clustering algorithm is stable since there are no cumulative effects of perturbations...

    Johnatan E. Peceroet al. An improved genetic algorithm for efficient scheduling on distributed ...

    • ...Moreover, the main focus is on a recent class of structured clustering, called convex, which has interesting properties [4] and has been recently used in the context of uncertainties in the scheduling problem [5]...
    • ...For example, considering arbitrary time execution and large communication delay the authors in [5] showed that the convex clustering are 3-Dominant...
    • ...The authors in [5] also investigated convex clusters in the context of the scheduling problem with disturbances...
    • ...Based on this assumption the authors in [5] claimed that any convex clustering algorithm is intrinsically stable since there are no cumulative effects of disturbances...

    Johnatan E. Peceroet al. A New Genetic Algorithm for Scheduling for Large Communication Delays

    • ...The problem of efficiently scheduling tasks on computational Grids has been deeply studied in the literature [12, 21, 23, 37, 30]...

    Johnatan E. Peceroet al. Efficient Hierarchical Task Scheduling on GRIDS Accounting for Computa...

Sort by: