2014 · 36 citations · 19 references
ComputingComputer EngineeringComputer ScienceComputer ArchitectureComputer NetworksSchedulingLatency OptimizationPerformance OptimizationResource SchedulingResource-constrained SchedulingTask SchedulingThroughput OptimizationEnergy-efficient AlgorithmsLatency Trade-offsMany-core ArchitectureMany-core ProcessorsRun-time MappingRun-time Resource AllocationThroughputThroughput Improvement
In this paper, we propose a run-time mapping algorithm, CASqA, for networked many-core systems. In this algorithm, the level of contiguousness of the allocated processors (α) can be adjusted in a fine-grained fashion. A strictly contiguous allocation (α = 0) decreases the latency and power dissipation of the network and improves the applications execution time. However, it limits the achievable throughput and increases the turnaround time of the applications. As a result, recent works consider non-contiguous allocation (α = 1) to improve the throughput traded off against applications execution time and network metrics. In contradiction, our experiments show that a higher throughput (by 3%) with improved network performance can be achieved when using intermediate α values. More precisely, up to 35% drop in the network costs can be gained by adjusting the level of contiguity compared to non-contiguous cases, while the achieved throughput is kept constant. Moreover, CASqA provides at least 32% energy saving in the network compared to other works.
19
William J. Dally, Brian Towles · 2001 · 3.2K citations
Engineering, Computer Engineering, Electrical Engineering +17
Dark silicon and the end of multicore scaling
Hadi Esmaeilzadeh, Emily Blem, Renée St. Amant et al. · 2011 · 1.5K citations
Mapping on multi/many-core systems
Amit Kumar Singh, Muhammad Shafique, Akash Kumar et al. · 2013 · 397 citations