Sciweavers

1628 search results - page 127 / 326
» Dynamically Adaptive Parallel Programs
Sort
View
109
Voted
ICDCS
1991
IEEE
15 years 6 months ago
Supporting the development of network programs
of ‘‘network computers’’ is inherently lessAbstract predictable than that of more traditional distributed memory systems, such as hypercubes [22], since both theFor computa...
Bernd Bruegge, Peter Steenkiste
TVCG
2010
153views more  TVCG 2010»
15 years 1 months ago
Parallel View-Dependent Level-of-Detail Control
—We present a scheme for view-dependent level-of-detail control that is implemented entirely on programmable graphics hardware. Our scheme selectively refines and coarsens an ar...
Liang Hu, Pedro V. Sander, Hugues Hoppe
143
Voted
ICS
2000
Tsinghua U.
15 years 6 months ago
Hardware-only stream prefetching and dynamic access ordering
Memory system bottlenecks limit performance for many applications, and computations with strided access patterns are among the hardest hit. The streams used in such applications h...
Chengqiang Zhang, Sally A. McKee
127
Voted
GECCO
2007
Springer
212views Optimization» more  GECCO 2007»
15 years 9 months ago
A hybrid evolutionary programming algorithm for spread spectrum radar polyphase codes design
This paper presents a hybrid evolutionary programming algorithm to solve the spread spectrum radar polyphase code design problem. The proposed algorithm uses an Evolutionary Progr...
Ángel M. Pérez-Bellido, Sancho Salce...
148
Voted
IPPS
1998
IEEE
15 years 7 months ago
Low Memory Cost Dynamic Scheduling of Large Coarse Grain Task Graphs
Schedulinglarge task graphsis an importantissue in parallel computingsince it allowsthe treatment of big size problems. In this paper we tackle the following problem: how to sched...
Michel Cosnard, Emmanuel Jeannot, Laurence Rougeot