Sciweavers

429 search results - page 68 / 86
» Group Routing without Group Routing Tables
Sort
View
ICS
2000
Tsinghua U.
14 years 9 days ago
Improving parallel system performance by changing the arrangement of the network links
The Midimew network is an excellent contender for implementing the communication subsystem of a high performance computer. This network is an optimal 2D topology in the sense ther...
Valentin Puente, Cruz Izu, José A. Gregorio...
ICNS
2009
IEEE
13 years 6 months ago
HGRID: Fault Tolerant, Log2N Resource Management for Grids
Grid Resource Discovery Service is currently a very important focus of research. We propose a scheme that presents essential characteristics for efficient, self-configuring and fau...
Antonia Gallardo, Kana Sanjeevan, Luis Díaz...
TMC
2010
138views more  TMC 2010»
13 years 7 months ago
Reliable Anchor-Based Sensor Localization in Irregular Areas
—Localization is a fundamental problem in wireless sensor networks and its accuracy impacts the efficiency of location-aware protocols and applications, such as routing and stora...
Bin Xiao, Lin Chen, Qingjun Xiao, Minglu Li
ISPD
2005
ACM
174views Hardware» more  ISPD 2005»
14 years 2 months ago
Fast and accurate rectilinear steiner minimal tree algorithm for VLSI design
In this paper, we present a very fast and accurate rectilinear Steiner minimal tree (RSMT)1 algorithm called FLUTE. The algorithm is an extension of the wirelength estimation appr...
Chris C. N. Chu, Yiu-Chung Wong
TABLETOP
2008
IEEE
14 years 3 months ago
System design for the WeSpace: Linking personal devices to a table-centered multi-user, multi-surface environment
The WeSpace is a long-term project dedicated to the creation of environments supporting walkup and share collaboration among small groups. The focus of our system design has been ...
Hao Jiang, Daniel Wigdor, Clifton Forlines, Chia S...