References of "Pecero, Johnatan 40020872"
     in
Bookmark and Share    
Full Text
Peer Reviewed
See detailA Multi-objective GRASP Algorithm for Joint Optimization of Energy Consumption and Schedule Length of Precedence-Constrained Applications
Pecero, Johnatan UL; Bouvry, Pascal UL; Fraire Huacuja, Hector J. et al

in 2011 IEEE Ninth International Conference on Dependable, Autonomic and Secure Computing (DASC) (2011, December 14)

We address the problem of scheduling precedence-constrained scientific applications on a heterogeneous distributed processor system with the twin objectives of minimizing simultaneously energy consumption ... [more ▼]

We address the problem of scheduling precedence-constrained scientific applications on a heterogeneous distributed processor system with the twin objectives of minimizing simultaneously energy consumption and schedule length. Previous research efforts on scheduling have focused on the minimization of a quality of service metric based on the completion time of applications (e.g., the schedule length). Recently, many researchers are working on the design of new scheduling algorithms that consider the minimization of energy consumption. We report a new scheduling algorithm accounting for both objectives. The new scheduling algorithm is based on a multi-start randomized adaptive search technique (GRASP framework) that adopts Dynamic Voltage Scaling technique to minimize energy consumption. This technique enables processors to operate in different voltage supply levels at the cost of sacrificing clock frequencies. This multiple voltage implies a trade-off between the quality of the schedules and energy consumption. Therefore, the new proposed approach is designed as a multi-objective algorithm that simultaneously optimize both objectives. Simulation results on a set of real-world applications emphasize the robust performance of the proposed approach. [less ▲]

Detailed reference viewed: 113 (1 UL)
Full Text
Peer Reviewed
See detailA Multi-Objective GRASP for Energy-aware Scheduling
Pecero, Johnatan UL; Pinel, Frédéric UL; Bouvry, Pascal UL et al

in International Congress on Computer Science Research (2011, October 28)

Detailed reference viewed: 68 (2 UL)
Full Text
Peer Reviewed
See detailA two-phase heuristic for the scheduling of independent tasks on computational grids
Pinel, Frédéric UL; Pecero, Johnatan UL; Bouvry, Pascal UL et al

in High Performance Computing and Simulation (HPCS), 2011 International Conference on (2011)

Detailed reference viewed: 113 (3 UL)
Full Text
Peer Reviewed
See detailScalable and Energy-Efficient Scheduling Techniques for Large-Scale Systems
Diaz, Cesar UL; Guzek, Mateusz UL; Pecero, Johnatan UL et al

in Computer and Information Technology (CIT), 2011 IEEE 11th International Conference on (2011)

The scalability of a computing system can be identified by at least three components: (a) size, (b) geograph- ical distribution, and (c) administrative constraints. Newer paradigms, such as clouds, grids ... [more ▼]

The scalability of a computing system can be identified by at least three components: (a) size, (b) geograph- ical distribution, and (c) administrative constraints. Newer paradigms, such as clouds, grids, and clusters bring in more parameters to the aforementioned list, namely heterogeneity, energy consumption, and transparency. To optimize the per- formance of a computing system, it is manner that exploits heterogeneity and is scalable. Moreover, newer systems also demand energy efficiency as an integral part of schedulers. In this paper, we evaluate the behavior of low complexity energy- efficient algorithms for scheduling. The set of experimental results showed that the evaluated heuristics perform as effi- ciently as related approaches; demonstrating their applicability and scalability for the considered problem. [less ▲]

Detailed reference viewed: 135 (1 UL)
Full Text
Peer Reviewed
See detailEnergy-Aware Scheduling of Parallel Applications with Multi-Objective Evolutionary Algorithm
Guzek, Mateusz UL; Pecero, Johnatan UL; Dorronsoro, Bernabé UL et al

in EVOLVE 2011, A bridge between Probability, Set Oriented Numerics and Evolutionary Computation, Bourglinster Castle, Luxembourg, May 25-27 2011 (2011)

Detailed reference viewed: 123 (4 UL)
Full Text
Peer Reviewed
See detailAn overview of energy efficiency techniques in cluster computing systems
Valentini, Giorgio Luigi; Lassonde, Walter; Khan, Samee Ullah et al

in Cluster Computing (2011), 16(1), 3-15

Detailed reference viewed: 327 (2 UL)
Full Text
Peer Reviewed
See detailEnergy-Aware Fast Scheduling Heuristics in Heterogeneous Computing Systems
Diaz, Cesar UL; Guzek, Mateusz UL; Pecero, Johnatan UL et al

in High Performance Computing and Simulation (HPCS), 2011 International Conference on (2011)

In heterogeneous computing systems it is crucial to sched- ule tasks in a manner that exploits the heterogeneity of the resources and applications to optimize systems perfor- mance. Moreover, the energy ... [more ▼]

In heterogeneous computing systems it is crucial to sched- ule tasks in a manner that exploits the heterogeneity of the resources and applications to optimize systems perfor- mance. Moreover, the energy efficiency in these systems is of a great interest due to different concerns such as opera- tional costs and environmental issues associated to carbon emissions. In this paper, we present a series of original low complexity energy efficient algorithms for scheduling. The main idea is to map a task to the machine that executes it fastest while the energy consumption is minimum. On the practical side, the set of experimental results showed that the proposed heuristics perform as efficiently as related ap- proaches, demonstrating their applicability for the consid- ered problem and its good scalability. [less ▲]

Detailed reference viewed: 228 (12 UL)
Full Text
Peer Reviewed
See detailA Review on Task Performance Prediction in Multi-core Based Systems
Pinel, Frédéric UL; Pecero, Johnatan UL; Bouvry, Pascal UL et al

in Computer and Information Technology (CIT), 2011 IEEE 11th International Conference on (2011)

Detailed reference viewed: 97 (1 UL)
Peer Reviewed
See detailEfficient Hierarchical Task Scheduling on GRIDS Accounting for Computation and Communications
Pecero, Johnatan UL; Pinel, Frédéric UL; Dorronsoro, Bernabé UL et al

in Bouvry, Pascal; González-Vélez, Horacio; Kolodziej, Joanna (Eds.) Intelligent Decision Systems in Large-Scale Distributed Environments, 362 (2011)

Detailed reference viewed: 115 (5 UL)
Full Text
Peer Reviewed
See detailEnergy-efficient scheduling on milliclusters with performance constraints
Pinel, Frédéric UL; Pecero, Johnatan UL; Bouvry, Pascal UL et al

in Green Computing and Communications (GreenCom), 2011 IEEE/ACM International Conference on (2011)

Today’s datacenters and large scale enterprise com- puting are power hungry. A lot of research effort is devoted in industry and academy to address this challenging issue. In this context, a new type of ... [more ▼]

Today’s datacenters and large scale enterprise com- puting are power hungry. A lot of research effort is devoted in industry and academy to address this challenging issue. In this context, a new type of enterprise computing platform is being investigated. This computing platform is composed of hundred of millicomputers, each requiring orders of magnitude less power. However, this approach brings challenges that must be met in order to compete with the current practice. This paper addresses two such critical challenges. First, it suggests how to decompose large applications into smaller tasks, better suited to millicomputers. Then, it casts the performance oriented and energy efficient problem into a soft real-time scheduling problem, for which several algorithms are then proposed and evaluated. Sensitivity analysis is used to provide insights into the model, and plan the evaluation of the scheduling algorithms. The contention found in multi-core millicomputing processors is also accounted for. [less ▲]

Detailed reference viewed: 87 (1 UL)
Full Text
Peer Reviewed
See detailMemory-aware Green Scheduling on Multi-core Processors
Pinel, Frédéric UL; Pecero, Johnatan UL; Bouvry, Pascal UL et al

in Proceedings of the Second International Workshop on Green Computing (2010, September 16)

Contention on shared resources such as cache and main memory slows down the execution of the applications affecting not only application performance but also induces inefficient use of energy. Therefore ... [more ▼]

Contention on shared resources such as cache and main memory slows down the execution of the applications affecting not only application performance but also induces inefficient use of energy. Therefore, in this paper we deal with the contention problem and energy optimization on shared resources multicore-based machines. Our main contribution is a memory-aware resource allocation algorithm that minimize energy consumption by reducing contention conflicts and maximizing performance. We design a heuristic that includes in its objective function the impact of the contention on the application performance. Experimental results emphasize the interest of the provided solution. [less ▲]

Detailed reference viewed: 94 (1 UL)
Full Text
Peer Reviewed
See detailLow energy and high performance scheduling on scalable computing systems
Pecero, Johnatan UL; Bouvry, Pascal UL; Barrios, Carlos J.

in Proceedings of the Latin-American Conference on High Performance Computing (CLCAR 2010) (2010, August 28)

With the fast development of supercomputers, energy consumption by large scale computer systems has become a major concern. How to reduce energy consumption is now a critical issue in designing high ... [more ▼]

With the fast development of supercomputers, energy consumption by large scale computer systems has become a major concern. How to reduce energy consumption is now a critical issue in designing high-performance computing systems. Moreover, reducing energy consumption for high-performance computing can bring various benefits such as, reduce monetary operating costs, increase system reliability, and reduction of environmental impacts. Therefore, in this paper we address the problem of scheduling precedence-constrained parallel applications on heterogeneous scalable computing systems with the objectives of minimizing finish time and reduce energy consumption. We provide a scheduling algorithm based on the best-effort idea that adopts dynamic voltage scaling (DVS) to reduce energy consumption. That is, the algorithm firstly looks for nearoptimal solutions employing a list-based scheduling algorithm to find the minimum finish time (besteffort). Then, a fast random local search algorithm that exploits voltage scaling is used to reduce the energy consumption of the generated schedule without any performance degradation. Simulation results on structured graphs representing real-world applications emphasize the interest of the proposed approach. [less ▲]

Detailed reference viewed: 62 (0 UL)
Full Text
Peer Reviewed
See detailAn improved genetic algorithm for efficient scheduling on distributed memory parallel systems
Pecero, Johnatan UL; Bouvry, Pascal UL

in ACS/IEEE International Conference on Computer Systems and Applications - AICCSA 2010 (2010, May 19)

A key issue related to the distributed memory multiprocessors architecture for achieving high performance computing is the efficient scheduling of heavily communicated parallel applications such that the ... [more ▼]

A key issue related to the distributed memory multiprocessors architecture for achieving high performance computing is the efficient scheduling of heavily communicated parallel applications such that the total execution time is minimized. Therefore, this paper provides a genetic algorithm based on task clustering techniques for scheduling parallel applications with large communication delays on distributed memory parallel systems. The genetic algorithm is improved with the introduction of some extra knowledge about the scheduling problem. This knowledge is represented by a class of clustering heuristic which is based on structural properties of the parallel application. The major feature of the proposed algorithm is that it takes advantage of the effectiveness of task clustering for reducing communication delays combined with the ability of the genetic algorithms for exploring and exploiting information of the search space of the scheduling problem. The algorithm is assessed by simulation run on some families of traced graphs which represents some of the numerical parallel application programs, and a set of randomly generated applications. Simulation results showed that this algorithm significantly improves the performance of related approaches. [less ▲]

Detailed reference viewed: 87 (0 UL)
Full Text
Peer Reviewed
See detailScheduling Instructions on Hierarchical Machines
Blachot, Florent; Huard, Guillaume; Pecero, Johnatan UL et al

in 2010 IEEE International Symposium on Parallel & Distributed Processing, Workshops and Phd Forum (IPDPSW) (2010, April 23)

The aim of this work is to study the problem of scheduling fine grain task graphs on hierarchical distributed systems with communication delay. We consider as a case study how to schedule the instructions ... [more ▼]

The aim of this work is to study the problem of scheduling fine grain task graphs on hierarchical distributed systems with communication delay. We consider as a case study how to schedule the instructions on a processor that implements incomplete bypass ( ST200). We show first how this problem can be expressed as scheduling unitary tasks on a hierarchical architecture with heavy communications between clustered units. The proposed analysis is generic and can be extended to other challenging problems like scheduling in clusters of multi-cores. Our main result is an approximation algorithm based on list scheduling whose approximation ratio is the minimum of two expressions, the first one depends on the number of clusters while the second one depends on the communication delay. Experiments run on random graphs and on structured graphs demonstrate the effectiveness of the proposed approach. [less ▲]

Detailed reference viewed: 69 (0 UL)
Full Text
Peer Reviewed
See detailScheduling with uncertainties on new computing platforms
Mahjoub, Amine; Pecero, Johnatan UL; Trystram, Denis

in Computational Optimization and Applications (2010), 48(2), 369-398

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 ... [more ▼]

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. [less ▲]

Detailed reference viewed: 54 (0 UL)
Full Text
Peer Reviewed
See detailA Cellular Genetic Algorithm for Scheduling Applications and Energy-Aware Communication Optimization
Guzek, Mateusz UL; Pecero, Johnatan UL; Dorronsoro, Bernabé UL et al

in Proceedings of the 2010 International Conference on High Performance Computing & Simulation (2010)

Detailed reference viewed: 115 (2 UL)
Full Text
Peer Reviewed
See detailA New Genetic Algorithm for Scheduling for Large Communication Delays
Pecero, Johnatan UL; Trystram, Denis; Zomaya, Albert Y.

in 15th International Euro-Par Conference (2009, August 28)

In modern parallel and distributed systems, the time for exchanging data is usually larger than that for computing elementary operations. Consequently, these communications slow down the execution of the ... [more ▼]

In modern parallel and distributed systems, the time for exchanging data is usually larger than that for computing elementary operations. Consequently, these communications slow down the execution of the application scheduled on such systems. Accounting for these communications is essential for attaining efficient hardware and software utilization. Therefore, we provide in this paper a new combined approach for scheduling parallel applications with large communication delays on an arbitrary number of processors. In this approach, a genetic algorithm is improved with the introduction of some extra knowledge about the scheduling problem. This knowledge is represented by a class of clustering algorithms introduced recently, namely, convex clusters which are based on structural properties of the parallel applications. The developed algorithm is assessed by simulations run on some families of synthetic task graphs and randomly generated applications. The comparison with related approaches emphasizes its interest. [less ▲]

Detailed reference viewed: 68 (0 UL)