Sciweavers

414 search results - page 36 / 83
» Rate of change load balancing in distributed and parallel sy...
Sort
View
127
Voted
ICPP
1998
IEEE
15 years 4 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
PARLE
1993
15 years 4 months ago
On the Performance of Parallel Join Processing in Shared Nothing Database Systems
: Parallel database systems aim at providing high throughput for OLTP transactions as well as short response times for complex and data-intensive queries. Shared nothing systems re...
Robert Marek, Erhard Rahm
106
Voted
ICPPW
2006
IEEE
15 years 6 months ago
Multiple Flows of Control in Migratable Parallel Programs
Many important parallel applications require multiple flows of control to run on a single processor. In this paper, we present a study of four flow-of-control mechanisms: proces...
Gengbin Zheng, Laxmikant V. Kalé, Orion Sky...
124
Voted
NPC
2005
Springer
15 years 6 months ago
A Performance-Based Parallel Loop Self-scheduling on Grid Computing Environments
Efficient loop scheduling on parallel and distributed systems depends mostly on load balancing, especially on heterogeneous PC-based cluster and grid computing environments. In thi...
Wen-Chung Shih, Chao-Tung Yang, Shian-Shyong Tseng
103
Voted
ISSAC
2009
Springer
155views Mathematics» more  ISSAC 2009»
15 years 7 months ago
Parallel sparse polynomial multiplication using heaps
We present a high performance algorithm for multiplying sparse distributed polynomials using a multicore processor. Each core uses a heap of pointers to multiply parts of the poly...
Michael B. Monagan, Roman Pearce