Sciweavers

1753 search results - page 125 / 351
» Dynamic Scan Scheduling
Sort
View
SRDS
2008
IEEE
15 years 9 months ago
Dynamically Quantifying and Improving the Reliability of Distributed Storage Systems
In this paper, we argue that the reliability of large-scale storage systems can be significantly improved by using better reliability metrics and more efficient policies for rec...
Rekha Bachwani, Leszek Gryz, Ricardo Bianchini, Ce...
122
Voted
ICC
2007
IEEE
15 years 9 months ago
A Measurement Based Dynamic Policy for Switched Processing Systems
Abstract- Switched Processing Systems (SPS) represent a canonical model for many areas of applications of communication, computer and manufacturing systems. They are characterized ...
Ying-Chao Hung, George Michailidis
EGH
2005
Springer
15 years 8 months ago
Optimal automatic multi-pass shader partitioning by dynamic programming
Complex shaders must be partitioned into multiple passes to execute on GPUs with limited hardware resources. Automatic partitioning gives rise to an NP-hard scheduling problem tha...
Alan Heirich
IWOMP
2009
Springer
15 years 7 months ago
Dynamic Task and Data Placement over NUMA Architectures: An OpenMP Runtime Perspective
Abstract. Exploiting the full computational power of current hierarchical multiprocessor machines requires a very careful distribution of threads and data among the underlying non-...
François Broquedis, Nathalie Furmento, Bric...
145
Voted
DDECS
2007
IEEE
201views Hardware» more  DDECS 2007»
15 years 9 months ago
Built in Defect Prognosis for Embedded Memories
: As scan compression replaces the traditional scan it is important to understand how it works with power. DFT MAX represents one of the two primary scan compression solutions used...
Prashant Dubey, Akhil Garg, Sravan Kumar Bhaskaran...