Sciweavers

606 search results - page 93 / 122
» Complexity Results for Checking Distributed Implementability
Sort
View
CCGRID
2009
IEEE
15 years 8 months ago
Multicast Trees for Collaborative Applications
—Current implementations of real-time collaborative applications rely on a dedicated infrastructure to carry out all synchronizing and communication functions, and require all en...
Krzysztof Rzadca, Jackson Tan Teck Yong, Anwitaman...
DATE
2009
IEEE
122views Hardware» more  DATE 2009»
15 years 8 months ago
A highly resilient routing algorithm for fault-tolerant NoCs
Current trends in technology scaling foreshadow worsening transistor reliability as well as greater numbers of transistors in each system. The combination of these factors will so...
David Fick, Andrew DeOrio, Gregory K. Chen, Valeri...
ICRA
2008
IEEE
140views Robotics» more  ICRA 2008»
15 years 8 months ago
Multi-robot routing under limited communication range
Abstract— Teams of mobile robots have been recently proposed as effective means of completing complex missions involving multiple tasks spatially distributed over a large area. A...
Alejandro R. Mosteo, Luis Montano, Michail G. Lago...
IEEEPACT
2008
IEEE
15 years 8 months ago
Exploiting loop-dependent stream reuse for stream processors
The memory access limits the performance of stream processors. By exploiting the reuse of data held in the Stream Register File (SRF), an on-chip storage, the number of memory acc...
Xuejun Yang, Ying Zhang, Jingling Xue, Ian Rogers,...
ITNG
2008
IEEE
15 years 8 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