Sciweavers

4171 search results - page 177 / 835
» Distributed Data Structure Design for Scientific Computation
Sort
View
ISPDC
2006
IEEE
16 years 14 days ago
How to Achieve High Throughput with Dynamic Tree-Structured Coterie
Data replication permits a better network bandwidth utilization and minimizes the effect of latency in large-scale systems such as computing grids. However, the cost of maintainin...
Ivan Frain, Abdelaziz Mzoughi, Jean Paul Bahsoun
IPPS
2000
IEEE
15 years 10 months ago
Optoelectronic Multi-chip Modules Based on Imaging Fiber Bundle Structures
In this paper, we present a new packaging architecture for chip-level optical interconnections based on imaging fiber bundles. Imaging fiber bundles consist of densely packed arra...
Donald M. Chiarulli, Steven P. Levitan
GPC
2007
Springer
16 years 18 days ago
Design of PeerSum: A Summary Service for P2P Applications
Sharing huge databases in distributed systems is inherently difficult. As the amount of stored data increases, data localization techniques become no longer sufficient. A more ef...
Rabab Hayek, Guillaume Raschia, Patrick Valduriez,...
JPDC
2006
134views more  JPDC 2006»
15 years 6 months ago
Fast shared-memory algorithms for computing the minimum spanning forest of sparse graphs
Minimum Spanning Tree (MST) is one of the most studied combinatorial problems with practical applications in VLSI layout, wireless communication, and distributed networks, recent ...
David A. Bader, Guojing Cong
ICPPW
1999
IEEE
15 years 10 months ago
Design and Development of a Cooperative Shopping System with Shared Discussion Space
At current on-line shops, buyers almost independently enjoy shopping without anyone's help. However, there are many cases where they cooperate with people such as personal ad...
Takayuki Umeda, Hiroyuki Tarumi, Yahiko Kambayashi