![]() Pecero, Johnatan ![]() ![]() ![]() in International Congress on Computer Science Research (2011, October 28) Detailed reference viewed: 97 (2 UL)![]() Pinel, Frédéric ![]() ![]() in Proceedings of the Second International Conference on Parallel, Distributed, Grid and Cloud Computing for Engineering (2011) This paper exposes the mismatch between the classic problem representation in the scheduling problem of independent task mapping and the reality of multi-core proces- sors, operating system driven power ... [more ▼] This paper exposes the mismatch between the classic problem representation in the scheduling problem of independent task mapping and the reality of multi-core proces- sors, operating system driven power management and time sharing for overlapping I/O with computation. A new, simple, model is proposed to address this gap. The model, along with a scheduling heuristic, are applied to the evaluation of software pipelin- ing in the context of the recent millicomputing initiative. [less ▲] Detailed reference viewed: 161 (12 UL)![]() Pinel, Frédéric ![]() ![]() ![]() 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: 121 (1 UL)![]() ![]() Pecero, Johnatan ![]() ![]() ![]() in Bouvry, Pascal; González-Vélez, Horacio; Kolodziej, Joanna (Eds.) Intelligent Decision Systems in Large-Scale Distributed Environments, 362 (2011) Detailed reference viewed: 152 (6 UL)![]() Pinel, Frédéric ![]() ![]() ![]() in Computer and Information Technology (CIT), 2011 IEEE 11th International Conference on (2011) Detailed reference viewed: 132 (1 UL)![]() Pinel, Frédéric ![]() ![]() ![]() in Security and Intelligent Information Systems (2011) Detailed reference viewed: 189 (16 UL)![]() ; ; et al in Cluster Computing (2011), 16(1), 3-15 Detailed reference viewed: 414 (2 UL)![]() Pinel, Frédéric ![]() ![]() ![]() in High Performance Computing and Simulation (HPCS), 2011 International Conference on (2011) Detailed reference viewed: 142 (3 UL)![]() Pinel, Frédéric ![]() ![]() ![]() 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: 128 (1 UL)![]() ![]() Pinel, Frédéric ![]() ![]() ![]() Scientific Conference (2010) We propose to study different communication models of a parallel genetic algorithm. The specific algorithm is a parallel asynchronous cellular genetic algorithm targeted at multi-core architectures. The ... [more ▼] We propose to study different communication models of a parallel genetic algorithm. The specific algorithm is a parallel asynchronous cellular genetic algorithm targeted at multi-core architectures. The models considered are a fine-grain communication based on POSIX locks, a coarse-grain communications (islands), and a fine-grain communication similar to the first one but without protecting access to shared memory. This study applies the different models to well known test problems. [less ▲] Detailed reference viewed: 94 (1 UL)![]() Pinel, Frédéric ![]() ![]() ![]() in Parallel & Distributed Processing, Workshops and Phd Forum (IPDPSW), 2010 IEEE International Symposium on (2010) Detailed reference viewed: 154 (2 UL)![]() Pinel, Frédéric ![]() ![]() in 2009 International Conference of Soft Computing and Pattern Recognition (2009, December 31) Detailed reference viewed: 92 (1 UL)![]() Pinel, Frédéric ![]() ![]() in International Conference on Parallel Processing and Applied Mathematics (2009) Detailed reference viewed: 57 (1 UL) |
||