3202 search results - page 188 / 641 » Memory access scheduling |
122
Voted
IPL
2008
15 years 5 months ago
2008
It is a truism that for a machine to have a useful access to memory or workspace, it must "know" where its input ends and its working memory begins. Most machine models ...
131
Voted
CLUSTER
2004
IEEE
15 years 8 months ago
2004
IEEE
Gang Scheduling and related techniques are widely believed to be necessary for efficientjob scheduling on distributed memory parallel computers. This is hecause they minimize cont...
144
click to vote
JSA
2000
15 years 4 months ago
2000
Scheduling DAGs with communication times is the theoretical basis for achieving efficient parallelism on distributed memory systems. We generalize Graham's task-level in a ma...
127
Voted
IPPS
1998
IEEE
15 years 9 months ago
1998
IEEE
Abstract. The nano-threads programming model was proposed to effectively integrate multiprogramming on shared-memory multiprocessors, with the exploitation of fine-grain parallelis...
141
Voted
CODES
2001
IEEE
15 years 8 months ago
2001
IEEE
Due to rapidly increasing system complexity, shortening time-tomarket, and growing demand for hard real-time systems, formal methods are becoming indispensable in the synthesis of...