Sciweavers

2703 search results - page 157 / 541
» Optimizing memory transactions
Sort
View
EVOW
2008
Springer
13 years 12 months ago
A Memory Enhanced Evolutionary Algorithm for Dynamic Scheduling Problems
Abstract. This paper describes a memory enhanced evolutionary algorithm (EA) approach to the dynamic job shop scheduling problem. Memory enhanced EAs have been widely investigated ...
Gregory J. Barlow, Stephen F. Smith
PPOPP
2009
ACM
14 years 10 months ago
Comparability graph coloring for optimizing utilization of stream register files in stream processors
A stream processor executes an application that has been decomposed into a sequence of kernels that operate on streams of data elements. During the execution of a kernel, all stre...
Xuejun Yang, Li Wang, Jingling Xue, Yu Deng, Ying ...
IPPS
2006
IEEE
14 years 4 months ago
Optimal map construction of an unknown torus
In this paper we consider the map construction problem in the case of an anonymous, unoriented torus of unknown size. An agent that can move from node to neighbouring node in the ...
Hanane Becha, Paola Flocchini
SIGMETRICS
2005
ACM
120views Hardware» more  SIGMETRICS 2005»
14 years 3 months ago
Automatic measurement of memory hierarchy parameters
The running time of many applications is dominated by the cost of memory operations. To optimize such applications for a given platform, it is necessary to have a detailed knowled...
Kamen Yotov, Keshav Pingali, Paul Stodghill
ACMMSP
2004
ACM
92views Hardware» more  ACMMSP 2004»
14 years 3 months ago
Instruction combining for coalescing memory accesses using global code motion
Instruction combining is an optimization to replace a sequence of instructions with a more efficient instruction yielding the same result in a fewer machine cycles. When we use it...
Motohiro Kawahito, Hideaki Komatsu, Toshio Nakatan...