Sciweavers

549 search results - page 84 / 110
» Computing All the Best Swap Edges Distributively
Sort
View
ANCS
2007
ACM
15 years 1 months ago
On LID assignment in infiniBand networks
To realize a path in an InfiniBand network, an address, known as Local IDentifier (LID) in the InfiniBand specification, must be assigned to the destination and used in the forwar...
Wickus Nienaber, Xin Yuan, Zhenhai Duan
MOBIWAC
2009
ACM
15 years 4 months ago
The sociable traveller: human travelling patterns in social-based mobility
Understanding how humans move is a key factor for the design and evaluation of networking protocols and mobility management solutions in mobile networks. This is particularly true...
Chiara Boldrini, Marco Conti, Andrea Passarella
STOC
2004
ACM
121views Algorithms» more  STOC 2004»
15 years 10 months ago
Lower bounds for dynamic connectivity
We prove an (lg n) cell-probe lower bound on maintaining connectivity in dynamic graphs, as well as a more general trade-off between updates and queries. Our bound holds even if t...
Mihai Patrascu, Erik D. Demaine
IEEEPACT
2009
IEEE
15 years 4 months ago
Using Aggressor Thread Information to Improve Shared Cache Management for CMPs
—Shared cache allocation policies play an important role in determining CMP performance. The simplest policy, LRU, allocates cache implicitly as a consequence of its replacement ...
Wanli Liu, Donald Yeung
IEEEPACT
2006
IEEE
15 years 3 months ago
Communist, utilitarian, and capitalist cache policies on CMPs: caches as a shared resource
As chip multiprocessors (CMPs) become increasingly mainstream, architects have likewise become more interested in how best to share a cache hierarchy among multiple simultaneous t...
Lisa R. Hsu, Steven K. Reinhardt, Ravishankar R. I...