35 search results - page 2 / 7 » Loop Scheduling and Partitions for Hiding Memory Latencies |
PLDI
1995
ACM
13 years 8 months ago
1995
ACM
Traditional list schedulers order instructions based on an optimistic estimate of the load latency imposed by the hardware and therefore cannot respond to variations in memory lat...
MICRO
2000
IEEE
13 years 4 months ago
2000
IEEE
level of abstraction, compared with the program representation for scalar optimizations. For example, loop unrolling and loop unrolland-jam transformations exploit the large regist...
ISCAPDCS
2004
13 years 6 months ago
2004
FG is a programming environment for asynchronous programs that run on clusters and fit into a pipeline framework. It enables the programmer to write a series of synchronous functi...
DATE
2008
IEEE
13 years 11 months ago
2008
IEEE
ÄÓÓÔ× Ö Ø ÑÓ×Ø ÑÔÓÖØ ÒØ × Ø ÓÒ× ÓÖ Ñ ÔÔÐ ¹ Ø ÓÒ׺ ÌÓ Ú Ô Ö ÓÖÑ Ò ¸ ØÛÓ ÐÓÓÔ ØÖ Ò× ÓÖ¹ Ñ Ø ÓÒ Ø Ò ÕÙ × Ö Ó Ø ...
DATE
2007
IEEE
13 years 11 months ago
2007
IEEE
In a parallel system with multiple CPUs, one of the key problems is to assign loop iterations to processors. This problem, known as the loop scheduling problem, has been studied i...