Sciweavers

45 search results - page 8 / 9
» Modeling Execution Time of Selected Computation and Communic...
Sort
View
ATAL
2005
Springer
14 years 28 days ago
Reasoning about joint beliefs for execution-time communication decisions
Just as POMDPs have been used to reason explicitly about uncertainty in single-agent systems, there has been recent interest in using multi-agent POMDPs to coordinate teams of age...
Maayan Roth, Reid G. Simmons, Manuela M. Veloso
IPPS
1996
IEEE
13 years 11 months ago
Practical Parallel Algorithms for Dynamic Data Redistribution, Median Finding, and Selection
A common statistical problem is that of nding the median element in a set of data. This paper presents a fastand portable parallel algorithm for nding the median given a set of el...
David A. Bader, Joseph JáJá
P2P
2003
IEEE
110views Communications» more  P2P 2003»
14 years 20 days ago
Range Addressable Network: A P2P Cache Architecture for Data Ranges
Peer-to-peer computing paradigm is emerging as a scalable and robust model for sharing media objects. In this paper, we propose an architecture and describe the associated algorit...
Anshul Kothari, Divyakant Agrawal, Abhishek Gupta,...
ITNG
2008
IEEE
14 years 1 months ago
Parallel FFT Algorithms on Network-on-Chips
This paper presents several parallel FFT algorithms with different degree of communication overhead for multiprocessors in Network-on-Chip(NoC) environment. Three different method...
Jun Ho Bahn, Jungsook Yang, Nader Bagherzadeh
MICRO
2003
IEEE
125views Hardware» more  MICRO 2003»
14 years 20 days ago
WaveScalar
Silicon technology will continue to provide an exponential increase in the availability of raw transistors. Effectively translating this resource into application performance, how...
Steven Swanson, Ken Michelson, Andrew Schwerin, Ma...