Titlebook: Euro-Par 2014: Parallel Processing; 20th International C Fernando Silva,Inês Dutra,Vítor Santos Costa Conference proceedings 2014 Springer

智力高

c-Eclipse: An Open-Source Management Framework for Cloud Applicationss must be elastically adapted at runtime to match the needs of a dynamic application-workload. In this paper, we introduce the architecture and implementation of c-Eclipse, and describe its key characteristics via a use-case scenario that involves a user creating a description of a 3-tier Cloud appl

和音

Modeling and Simulation of a Dynamic Task-Based Runtime System for Heterogeneous Multi-core Architecay be difficult to generalize. In this article, we show how we crafted a coarse-grain hybrid simulation/emulation of StarPU, a dynamic runtime for hybrid architectures, over SimGrid, a versatile simulator for distributed systems. This approach allows to obtain performance predictions accurate within

FID

傻瓜

Multi-Objective Auto-Tuning with Insieme: Optimization and Trade-Off Analysis for Time, Energy and Rl and a random search at a fraction of the required time (5%) or energy (8%). A comparison to a state-of-the-art multi-objective optimizer (NSGA-II) shows that RS-GDE3 computes solutions of higher quality. Finally, based on the trade-off solutions found by RS-GDE3, we provide a detailed analysis and

金哥占卜者

Characterizing the Performance-Energy Tradeoff of Small ARM Cores in HPC Computation subsystems: single instruction multiple data (SIMD)/floating point and the cache/memory hierarchy; and that static analysis of this kind is sufficient to predict which platform is best for a particular application/input pair. In the context of these findings, we evaluate how some of the key archite

懶洋洋

Rustproof

OASIS

DReAM: Per-Task DRAM Energy Metering in Multicore Systemsw cost, implementation of the ideal model (less than 5% accuracy error when 16 tasks share memory); and (iii) a comparison with standard methods (even distribution and access-count based) proving that . is more accurate than these other methods.

大酒杯

SPAGHETtI: Scheduling/Placement Approach for Task-Graphs on HETerogeneous archItecturean. Moreover, the number of resources to be used for executing the schedule is given by a linear time algorithm. When the resources are bounded we provide a method to reduce the number of necessary resources up to the bound providing a set of compromises between the makespan and the size of the infrastructure.

Glutinous