Sciweavers

Share
103 search results - page 1 / 21
» Efficient Task Partitioning Algorithms for Distributed Share...
Sort
View
ISCA
2002
IEEE
174views Hardware» more  ISCA 2002»
9 years 1 months ago
Efficient Task Partitioning Algorithms for Distributed Shared Memory Systems
In this paper, we consider the tree task graphs which arise from many important programming paradigms such as divide and conquer, branch and bound etc., and the linear task-graphs...
Sibabrata Ray, Hong Jiang
ICS
2009
Tsinghua U.
9 years 6 months ago
Dynamic task set partitioning based on balancing memory requirements to reduce power consumption
ABSTRACT Because of technology advances power consumption has emerged up as an important design issue in modern high-performance microprocessors. As a consequence, research on redu...
Diana Bautista, Julio Sahuquillo, Houcine Hassan, ...
IPPS
2010
IEEE
8 years 10 months ago
Efficient hardware support for the Partitioned Global Address Space
We present a novel architecture of a communication engine for non-coherent distributed shared memory systems. The shared memory is composed by a set of nodes exporting their memory...
Holger Fröning, Heiner Litz
GRID
2004
Springer
9 years 7 months ago
Memory Conscious Task Partition and Scheduling in Grid Environments
While resource management and task scheduling are identified challenges of Grid computing, current Grid scheduling systems mainly focus on CPU and network availability. Recent per...
Ming Wu, Xian-He Sun
books