Sciweavers

1074 search results - page 134 / 215
» Parallelizing post-placement timing optimization
Sort
View
APPROX
2009
Springer
163views Algorithms» more  APPROX 2009»
14 years 3 months ago
The Power of Preemption on Unrelated Machines and Applications to Scheduling Orders
Abstract. Scheduling jobs on unrelated parallel machines so as to minimize the makespan is one of the basic, well-studied problems in the area of machine scheduling. In the first ...
José R. Correa, Martin Skutella, José...
IPPS
2006
IEEE
14 years 3 months ago
An adaptive dynamic grid-based approach to data distribution management
a This paper presents a novel Adaptive Dynamic Gridbased Data Distribution Management (DDM) scheme, which we refer to as ADGB. The main objective of our protocol is to optimize DDM...
Azzedine Boukerche, YunFeng Gu, Regina Borges de A...
ICS
2001
Tsinghua U.
14 years 1 months ago
Analytical cache models with applications to cache partitioning
An accurate, tractable, analytic cache model for time-shared systems is presented, which estimates the overall cache missrate of a multiprocessing system with any cache size and t...
G. Edward Suh, Srinivas Devadas, Larry Rudolph
MICRO
2000
IEEE
176views Hardware» more  MICRO 2000»
13 years 8 months ago
An Advanced Optimizer for the IA-64 Architecture
level of abstraction, compared with the program representation for scalar optimizations. For example, loop unrolling and loop unrolland-jam transformations exploit the large regist...
Rakesh Krishnaiyer, Dattatraya Kulkarni, Daniel M....
CF
2010
ACM
14 years 2 months ago
Load balancing using dynamic cache allocation
Supercomputers need a huge budget to be built and maintained. To maximize the usage of their resources, application developers spend time to optimize the code of the parallel appl...
Miquel Moretó, Francisco J. Cazorla, Rizos ...