Sciweavers

685 search results - page 93 / 137
» Closure Operators for Order Structures
Sort
View
WDAG
2004
Springer
134views Algorithms» more  WDAG 2004»
15 years 11 months ago
An Optimistic Approach to Lock-Free FIFO Queues
Abstract. First-in-first-out (FIFO) queues are among the most fundamental and highly studied concurrent data structures. The most effective and practical dynamic-memory concurren...
Edya Ladan-Mozes, Nir Shavit
WEBDB
2010
Springer
152views Database» more  WEBDB 2010»
15 years 11 months ago
Reconciling two models of multihierarchical markup
For documents with complex or atypical annotations, multihierarchical structures play the role of the document tree in traditional XML documents. We define a model of overlapping...
Neil Moore
ISCA
2000
IEEE
121views Hardware» more  ISCA 2000»
15 years 10 months ago
Memory access scheduling
The bandwidth and latency of a memory system are strongly dependent on the manner in which accesses interact with the “3-D” structure of banks, rows, and columns characteristi...
Scott Rixner, William J. Dally, Ujval J. Kapasi, P...
TOOLS
2000
IEEE
15 years 10 months ago
Design and Implementation of CORBA-Based Subscription Server
The standard CORBA operation invocation model supports synchronous, one-way, and deferred synchronous interactions between clients and servers. However, this model is too restrict...
R. Maheshwari, R. Fatoohi
CC
2000
Springer
105views System Software» more  CC 2000»
15 years 10 months ago
MATOU: An Implementation of Mode-Automata
Mode-Automata have been proposed in [11]. They introduce, in the domain-specific data-flow language Lustre for reactive systems, a new construct devoted to the expression of runn...
Florence Maraninchi, Yann Rémond, Yannick R...