Sciweavers

2432 search results - page 259 / 487
» Using simple abstraction to reinvent computing for paralleli...
Sort
View
ICPP
2007
IEEE
16 years 14 days ago
Defending P2Ps from Overlay Flooding-based DDoS
A flooding-based search mechanism is often used in unstructured P2P systems. Although a flooding-based search mechanism is simple and easy to implement, it is vulnerable to overla...
Yunhao Liu, Xiaomei Liu, Chen Wang, Li Xiao
ICPP
2006
IEEE
16 years 6 days ago
Worst-Case Delay Control in Multi-Group Overlay Networks
This paper proposes a novel and simple adaptive control algorithm for the effective delay control and resource utilization of EMcast when the traffic load becomes heavy in the mu...
Wanqing Tu
SPAA
2005
ACM
15 years 11 months ago
Oblivious routing on geometric networks
We study oblivious routing in which the packet paths are constructed independently of each other. We give a simple oblivious routing algorithm for geometric networks in which the ...
Costas Busch, Malik Magdon-Ismail, Jing Xi
IPPS
1998
IEEE
15 years 10 months ago
Hyper Butterfly Network: A Scalable Optimally Fault Tolerant Architecture
Boundeddegreenetworks like deBruijn graphsor wrapped butterfly networks are very important from VLSI implementation point of view as well as for applications where the computing n...
Wei Shi, Pradip K. Srimani
DAC
2010
ACM
15 years 9 months ago
Efficient fault simulation on many-core processors
Fault simulation is essential in test generation, design for test and reliability assessment of integrated circuits. Reliability analysis and the simulation of self-test structure...
Michael A. Kochte, Marcel Schaal, Hans-Joachim Wun...