Sciweavers

822 search results - page 62 / 165
» Contention in shared memory algorithms
Sort
View
TON
2002
114views more  TON 2002»
13 years 8 months ago
Dynamic parallel access to replicated content in the internet
Popular content is frequently replicated in multiple servers or caches in the Internet to offload origin servers and improve end-user experience. However, choosing the best server ...
Pablo Rodriguez, Ernst Biersack
BMCBI
2007
146views more  BMCBI 2007»
13 years 9 months ago
PubMed related articles: a probabilistic topic-based model for content similarity
Background: We present a probabilistic topic-based model for content similarity called pmra that underlies the related article search feature in PubMed. Whether or not a document ...
Jimmy J. Lin, W. John Wilbur
TON
2008
155views more  TON 2008»
13 years 8 months ago
A comparative analysis of server selection in content replication networks
Server selection plays an essential role in content replication networks, such as peer-to-peer (P2P) and content delivery networks (CDNs). In this paper, we perform an analytical i...
Tao Wu, David Starobinski
ANCS
2009
ACM
13 years 6 months ago
A NFA-based programmable regular expression match engine
Pattern matching is the most computation intensive task of a network intrusion detection system (NIDS). In this paper we present a hardware architecture to speed up the pattern mat...
Derek Pao
NCA
2009
IEEE
14 years 3 months ago
Seed Scheduling for Peer-to-Peer Networks
—The initial phase in a content distribution (file sharing) scenario is delicate due to the lack of global knowledge and the dynamics of the overlay. An unwise distribution of t...
Flavio Esposito, Ibrahim Matta, Pietro Michiardi, ...