Sciweavers

1259 search results - page 13 / 252
» On Survivable Access Network Design: Complexity and Algorith...
Sort
View
HPDC
2009
IEEE
15 years 6 months ago
Maintaining reference graphs of globally accessible objects in fully decentralized distributed systems
Since the advent of electronic computing, the processors’ clock speed has risen tremendously. Now that energy efficiency requirements have stopped that trend, the number of proc...
Björn Saballus, Thomas Fuhrmann
111
Voted
MICRO
2009
IEEE
147views Hardware» more  MICRO 2009»
15 years 6 months ago
Complexity effective memory access scheduling for many-core accelerator architectures
Modern DRAM systems rely on memory controllers that employ out-of-order scheduling to maximize row access locality and bank-level parallelism, which in turn maximizes DRAM bandwid...
George L. Yuan, Ali Bakhoda, Tor M. Aamodt
IJON
2010
138views more  IJON 2010»
14 years 10 months ago
A dynamic Bayesian network to represent discrete duration models
Originally devoted to specific applications such as biology, medicine and demography, duration models are now widely used in economy, finance or reliability. Recent works in var...
Roland Donat, Philippe Leray, Laurent Bouillaut, P...
CN
1999
154views more  CN 1999»
14 years 11 months ago
Architectural Considerations in the Design of WDM-Based Optical Access Networks
We describe a WDM-based optical access network architecture for providing broadband Internet services. The architecture uses a passive collection and distribution network and a co...
Eytan Modiano, Richard A. Barry
95
Voted
NCA
2009
IEEE
15 years 6 months ago
A Distributed Algorithm for Web Content Replication
—Web caching and replication techniques increase accessibility of Web contents and reduce Internet bandwidth requirements. In this paper, we are considering the replica placement...
Sharrukh Zaman, Daniel Grosu