Sciweavers

1137 search results - page 4 / 228
» A study of slipstream processors
Sort
View
OPODIS
2008
13 years 9 months ago
Group Renaming
We study the group renaming problem, which is a natural generalization of the renaming problem. An instance of this problem consists of n processors, partitioned into m groups, ea...
Yehuda Afek, Iftah Gamzu, Irit Levy, Michael Merri...
ICS
2000
Tsinghua U.
13 years 11 months ago
Characterizing processor architectures for programmable network interfaces
The rapid advancements of networking technology have boosted potential bandwidth to the point that the cabling is no longer the bottleneck. Rather, the bottlenecks lie at the cros...
Patrick Crowley, Marc E. Fiuczynski, Jean-Loup Bae...
WDAG
2000
Springer
81views Algorithms» more  WDAG 2000»
13 years 11 months ago
Distributed Cooperation During the Absence of Communication
This paper presents a study of a distributed cooperation problem under the assumption that processors may not be able to communicate for a prolonged time. The problem for n proces...
Grzegorz Malewicz, Alexander Russell, Alexander A....
FPL
1995
Springer
129views Hardware» more  FPL 1995»
13 years 11 months ago
An Assessment of the Suitability of FPGA-Based Systems for Use in Digital Signal Processing
Abstract. FPGAs have been proposed as high-performance alternatives to DSP processors. This paper quantitatively compares FPGA performance against DSP processors and ASICs using ac...
Russell J. Petersen, Brad L. Hutchings
PDPTA
2007
13 years 9 months ago
Scheduling Divisible Workloads from Multiple Sources in Linear Daisy Chain Networks
— This paper considers scheduling divisible workloads from multiple sources in linear networks of processors. We propose a two phase scheduling strategy (TPSS) to minimize the ov...
Xinxin Liu, Han Zhao, Xiaolin Li