Sciweavers

292 search results - page 45 / 59
» Adaptive scheduling with parallelism feedback
Sort
View
138
Voted
HPCN
1999
Springer
15 years 5 months ago
Data Intensive Distributed Computing; A Medical Application Example
Modern scientific computing involves organizing, moving, visualizing, and analyzing massive amounts of data from around the world, as well as employing large-scale computation. The...
Jason Lee, Brian Tierney, William E. Johnston
DEBS
2008
ACM
15 years 2 months ago
Real-time, load-adaptive processing of continuous queries over data streams
We introduce a new type of query, called a real-time continuous query (RCQ), that captures the real-time requirements of processing data streams. We develop techniques to efficien...
Dhananjay Kulkarni, Chinya V. Ravishankar, Mitch C...
IEEEHPCS
2010
14 years 10 months ago
Reducing memory requirements of stream programs by graph transformations
Stream languages explicitly describe fork-join parallelism and pipelines, offering a powerful programming model for many-core Multi-Processor Systems on Chip (MPSoC). In an embedd...
Pablo de Oliveira Castro, Stéphane Louise, ...
127
Voted
ICPP
1998
IEEE
15 years 5 months ago
A memory-layout oriented run-time technique for locality optimization
Exploiting locality at run-time is a complementary approach to a compiler approach for those applications with dynamic memory access patterns. This paper proposes a memory-layout ...
Yong Yan, Xiaodong Zhang, Zhao Zhang
ICFP
2010
ACM
15 years 1 months ago
Lazy tree splitting
Nested data-parallelism (NDP) is a declarative style for programming irregular parallel applications. NDP languages provide language features favoring the NDP style, efficient com...
Lars Bergstrom, Mike Rainey, John H. Reppy, Adam S...