Sciweavers

822 search results - page 48 / 165
» Contention in shared memory algorithms
Sort
View
MICRO
2010
IEEE
202views Hardware» more  MICRO 2010»
13 years 3 months ago
Hardware Support for Relaxed Concurrency Control in Transactional Memory
Today's transactional memory systems implement the two-phase-locking (2PL) algorithm which aborts transactions every time a conflict happens. 2PL is a simple algorithm that pr...
Utku Aydonat, Tarek S. Abdelrahman
ANCS
2006
ACM
14 years 2 months ago
Advanced algorithms for fast and scalable deep packet inspection
Modern deep packet inspection systems use regular expressions to define various patterns of interest in network data streams. Deterministic Finite Automata (DFA) are commonly used...
Sailesh Kumar, Jonathan S. Turner, John Williams
WDAG
2004
Springer
144views Algorithms» more  WDAG 2004»
14 years 2 months ago
Contention-Free MAC Protocols for Wireless Sensor Networks
Abstract. A MAC protocol specifies how nodes in a sensor network access a shared communication channel. Desired properties of such MAC protocol are: it should be distributed and c...
Costas Busch, Malik Magdon-Ismail, Fikret Sivrikay...
IPPS
2008
IEEE
14 years 3 months ago
Impact of multicores on large-scale molecular dynamics simulations
Processing nodes of the Cray XT and IBM Blue Gene Massively Parallel Processing (MPP) systems are composed of multiple execution units, sharing memory and network subsystems. Thes...
Sadaf R. Alam, Pratul K. Agarwal, Scott S. Hampton...
CN
2002
82views more  CN 2002»
13 years 8 months ago
Optimal allocation of electronic content
Abstract-The delivery of large files to single users, such as application programs for some versions of the envisioned network computer, or movies, is expected by many to be one of...
Israel Cidon, Shay Kutten, Ran Soffer