Sign in
Author

Conference

Journal

Organization

Year

DOI
Look for results that meet for the following criteria:
since
equal to
before
between
and
Search in all fields of study
Limit my searches in the following fields of study
Agriculture Science
Arts & Humanities
Biology
Chemistry
Computer Science
Economics & Business
Engineering
Environmental Sciences
Geosciences
Material Science
Mathematics
Medicine
Physics
Social Science
Multidisciplinary
Keywords
(8)
Convex Set
Data Uncertainty
Distributed Computing
Grid Computing
Parallel Programs
Scheduling Algorithm
Task Scheduling
Processing Element
Subscribe
Academic
Publications
Scheduling with uncertainties on new computing platforms
Scheduling with uncertainties on new computing platforms,10.1007/s1058900993110,Computational Optimization and Applications,Amine Mahjoub,Johnatan
Edit
Scheduling with uncertainties on new computing platforms
(
Citations: 4
)
BibTex

RIS

RefWorks
Download
Amine Mahjoub
,
Johnatan E. Pecero Sánchez
,
Denis Trystram
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 online and wellknown offline algorithms.
Journal:
Computational Optimization and Applications  COMPUT OPTIM APPL
, vol. 48, no. 2, pp. 369398, 2011
DOI:
10.1007/s1058900993110
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.
(
www.springerlink.com
)
(
www.springerlink.com
)
(
www.springerlink.com
)
(
www.springerlink.com
)
More »
Citation Context
(4)
...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 Guzek
,
et al.
A Cellular Genetic Algorithm for scheduling applications and energyaw...
...For example, considering arbitrary time execution and large communication delay the authors in [
11
] showed that the convex clusterings are 3Dominant...
...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. Pecero
,
et 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 3Dominant...
...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. Pecero
,
et 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. Pecero
,
et al.
Efficient Hierarchical Task Scheduling on GRIDS Accounting for Computa...
References
(28)
Sensitivity analysis of scheduling algorithms
(
Citations: 15
)
Bernard Penz
,
Christophe Rapine
,
Denis Trystram
Journal:
European Journal of Operational Research  EJOR
, vol. 134, no. 3, pp. 606615, 2001
ANDES: Evaluating mapping strategies with synthetic programs
(
Citations: 5
)
João Pauloz Kitajima
,
Brigitte Plateau
,
Pascal Bouvry
,
Denis Trystram
Journal:
Journal of Systems Architecture  JSA
, vol. 42, no. 5, pp. 351365, 1996
On the robust shortest path problem
(
Citations: 50
)
Yu Gang
,
Yang Jian
Journal:
Computers & Operations Research  CoR
, vol. 25, no. 6, pp. 457468, 1998
Random orders
(
Citations: 22
)
Peter Winkler
Journal:
A Journal on The Theory of Ordered Sets and Its Applications  Order
, vol. 1, no. 4, pp. 317331, 1985
Robust Scheduling to Hedge Against Processing Time Uncertainty in SingleStage Production
(
Citations: 105
)
Richard L. Daniels
,
Panagiotis Kouvelis
Journal:
Management Science  MANAGE SCI
, vol. 41, no. 2, pp. 363376, 1995
Sort by:
Citations
(4)
A Cellular Genetic Algorithm for scheduling applications and energyaware communication optimization
(
Citations: 3
)
Mateusz Guzek
,
Johnatan E. Pecero
,
Bernabé Dorronsoro
,
Pascal Bouvry
,
Samee U. Khan
Published in 2010.
An improved genetic algorithm for efficient scheduling on distributed memory parallel systems
(
Citations: 1
)
Johnatan E. Pecero
,
Pascal Bouvry
Conference:
ACS/IEEE International Conference on Computer Systems and Applications
, 2010
A New Genetic Algorithm for Scheduling for Large Communication Delays
(
Citations: 1
)
Johnatan E. Pecero
,
Denis Trystram
,
Albert Y. Zomaya
Conference:
European Conference on Parallel Processing  EuroPar
, pp. 241252, 2009
Efficient Hierarchical Task Scheduling on GRIDS Accounting for Computation and Communications
Johnatan E. Pecero
,
Frederic Pinel
,
Bernabé Dorronsoro
,
Grégoire Danoy
,
Pascal Bouvry
,
Albert Y. Zomaya