Sciweavers

1823 search results - page 335 / 365
» Distributed lossy averaging
Sort
View
89
Voted
ICS
2005
Tsinghua U.
15 years 3 months ago
Low-power, low-complexity instruction issue using compiler assistance
In an out-of-order issue processor, instructions are dynamically reordered and issued to function units in their dataready order rather than their original program order to achiev...
Madhavi Gopal Valluri, Lizy Kurian John, Kathryn S...
LCTRTS
2005
Springer
15 years 3 months ago
Cache aware optimization of stream programs
Effective use of the memory hierarchy is critical for achieving high performance on embedded systems. We focus on the class of streaming applications, which is increasingly preval...
Janis Sermulins, William Thies, Rodric M. Rabbah, ...
SENSYS
2004
ACM
15 years 3 months ago
The flooding time synchronization protocol
Wireless sensor network applications, similarly to other distributed systems, often require a scalable time synchronization service enabling data consistency and coordination. Thi...
Miklós Maróti, Branislav Kusy, Gyula...
91
Voted
STOC
2004
ACM
138views Algorithms» more  STOC 2004»
15 years 3 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
76
Voted
WOSP
2004
ACM
15 years 3 months ago
Using locality of reference to improve performance of peer-to-peer applications
Peer-to-peer, or simply P2P, systems have recently emerged as a popular paradigm for building distributed applications. One key aspect of the P2P system design is the mechanism us...
Marcelo Werneck Barbosa, Melissa Morgado Costa, Ju...