Sciweavers

1102 search results - page 217 / 221
» Generalizing Updates: From Models to Programs
Sort
View
MOBIHOC
2005
ACM
14 years 7 months ago
Localization and routing in sensor networks by local angle information
Location information is very useful in the design of sensor network infrastructures. In this paper, we study the anchor-free 2D localization problem by using local angle measureme...
Jehoshua Bruck, Jie Gao, Anxiao Jiang
ISPD
2010
ACM
217views Hardware» more  ISPD 2010»
14 years 2 months ago
ITOP: integrating timing optimization within placement
Timing-driven placement is a critical step in nanometerscale physical synthesis. To improve design timing on a global scale, net-weight based global timing-driven placement is a c...
Natarajan Viswanathan, Gi-Joon Nam, Jarrod A. Roy,...
ICS
2009
Tsinghua U.
14 years 2 months ago
QuakeTM: parallelizing a complex sequential application using transactional memory
“Is transactional memory useful?” is the question that cannot be answered until we provide substantial applications that can evaluate its capabilities. While existing TM appli...
Vladimir Gajinov, Ferad Zyulkyarov, Osman S. Unsal...
CSFW
2009
IEEE
14 years 2 months ago
More Anonymous Onion Routing Through Trust
We consider using trust information to improve the anonymity provided by onion-routing networks. In particular, we introduce a model of trust in network nodes and use it to design...
Aaron Johnson, Paul F. Syverson
CF
2009
ACM
14 years 2 months ago
A light-weight fairness mechanism for chip multiprocessor memory systems
Chip Multiprocessor (CMP) memory systems suffer from the effects of destructive thread interference. This interference reduces performance predictability because it depends heavil...
Magnus Jahre, Lasse Natvig