Sciweavers

332 search results - page 21 / 67
» Hypercubic Sorting Networks
Sort
View
MST
2002
74views more  MST 2002»
13 years 7 months ago
Sorting and Counting Networks of Arbitrary Width and Small Depth
Costas Busch, Maurice Herlihy
IPPS
1998
IEEE
13 years 12 months ago
A Parallel Algorithm for Minimum Cost Path Computation on Polymorphic Processor Array
This paper describes a new parallel algorithm for Minimum Cost Path computation on the Polymorphic Processor Array, a massively parallel architecture based on a reconfigurable mesh...
Pierpaolo Baglietto, Massimo Maresca, Mauro Miglia...
DMSN
2009
ACM
14 years 2 months ago
FSort: external sorting on flash-based sensor devices
In long-term deployments of Wireless Sensor Networks, it is often more efficient to store sensor readings locally at each device and transmit those readings to the user only when ...
Panayiotis Andreou, Orestis Spanos, Demetrios Zein...
STOC
2004
ACM
138views Algorithms» more  STOC 2004»
14 years 1 months ago
Know thy neighbor's neighbor: the power of lookahead in randomized P2P networks
Several peer-to-peer networks are based upon randomized graph topologies that permit efficient greedy routing, e.g., randomized hypercubes, randomized Chord, skip-graphs and const...
Gurmeet Singh Manku, Moni Naor, Udi Wieder
IPPS
2005
IEEE
14 years 1 months ago
A Novel QoS Multicast Model in Mobile Ad Hoc Networks
Multicast applications for large-scale Mobile Ad hoc NETworks (MANETs) require an efficient and effective Quality of Service (QoS)-aware multicast model. The new requirements to ...
Guojun Wang, Jiannong Cao, Lifan Zhang, Keith C. C...