Sciweavers

6897 search results - page 1027 / 1380
» Parallelization of Modular Algorithms
Sort
View
SPAA
2004
ACM
16 years 5 days ago
Fighting against two adversaries: page migration in dynamic networks
Page migration is one of the fundamental subproblems in the framework of data management in networks. It occurs in a distributed network of processors sharing one indivisible memo...
Marcin Bienkowski, Miroslaw Korzeniowski, Friedhel...
DATE
2002
IEEE
84views Hardware» more  DATE 2002»
15 years 11 months ago
Highly Scalable Dynamically Reconfigurable Systolic Ring-Architecture for DSP Applications
Microprocessors are today getting more and more inefficient for a growing range of applications. Its principles -The Von Neumann paradigm[3]- based on the sequential execution of ...
Gilles Sassatelli, Lionel Torres, Pascal Benoit, T...
IJHPCA
2007
114views more  IJHPCA 2007»
15 years 6 months ago
An Approach To Data Distributions in Chapel
A key characteristic of today’s high performance computing systems is a physically distributed memory, which makes the efficient management of locality essential for taking adv...
R. E. Diaconescu, Hans P. Zima
JACM
2000
86views more  JACM 2000»
15 years 6 months ago
Periodification scheme: constructing sorting networks with constant period
We consider comparator networks M that are used repeatedly: while the output produced by M is not sorted, it is fed again into M. Sorting algorithms working in this way are called ...
Miroslaw Kutylowski, Krzysztof Lorys, Brigitte Oes...
RSA
2000
170views more  RSA 2000»
15 years 6 months ago
Delayed path coupling and generating random permutations
We analyze various stochastic processes for generating permutations almost uniformly at random in distributed and parallel systems. All our protocols are simple, elegant and are b...
Artur Czumaj, Miroslaw Kutylowski
« Prev « First page 1027 / 1380 Last » Next »