Sciweavers

643 search results - page 55 / 129
» Merge-Based Computation of Minimal Generators
Sort
View
APPT
2005
Springer
14 years 2 months ago
Contention-Free Communication Scheduling for Irregular Data Redistribution in Parallelizing Compilers
Abstract. The data redistribution problems on multi-computers had been extensively studied. Irregular data redistribution has been paid attention recently since it can distribute d...
Kun-Ming Yu, Chi-Hsiu Chen, Ching-Hsien Hsu, Chang...
CLOUD
2010
ACM
14 years 2 months ago
Making cloud intermediate data fault-tolerant
Parallel dataflow programs generate enormous amounts of distributed data that are short-lived, yet are critical for completion of the job and for good run-time performance. We ca...
Steven Y. Ko, Imranul Hoque, Brian Cho, Indranil G...
ICPP
1998
IEEE
14 years 1 months ago
A memory-layout oriented run-time technique for locality optimization
Exploiting locality at run-time is a complementary approach to a compiler approach for those applications with dynamic memory access patterns. This paper proposes a memory-layout ...
Yong Yan, Xiaodong Zhang, Zhao Zhang
CONEXT
2005
ACM
13 years 11 months ago
Optimal positioning of active and passive monitoring devices
Network measurement is essential for assessing performance issues, identifying and locating problems. Two common strategies are the passive approach that attaches specific device...
Claude Chaudet, Eric Fleury, Isabelle Guéri...
DAC
2005
ACM
13 years 11 months ago
Total power reduction in CMOS circuits via gate sizing and multiple threshold voltages
Minimizing power consumption is one of the most important objectives in IC design. Resizing gates and assigning different Vt’s are common ways to meet power and timing budgets. ...
Feng Gao, John P. Hayes