Sciweavers

95 search results - page 7 / 19
» Constructive, Deterministic Implementation of Shared Memory ...
Sort
View
PSC
1992
15 years 1 months ago
A Message Passing Implementation of Lazy Task Creation
Abstract. This paper describes an implementation technique for Multilisp's future construct aimed at large shared-memory multiprocessors. The technique is a variant of lazy ta...
Marc Feeley
111
Voted
ICC
2011
IEEE
237views Communications» more  ICC 2011»
13 years 9 months ago
Reorganized and Compact DFA for Efficient Regular Expression Matching
—Regular expression matching has become a critical yet challenging technique in content-aware network processing, such as application identification and deep inspection. To meet ...
Kai Wang, Yaxuan Qi, Yibo Xue, Jun Li
IWOMP
2011
Springer
14 years 11 days ago
A Runtime Implementation of OpenMP Tasks
Many task-based programming models have been developed and refined in recent years to support application development for shared memory platforms. Asynchronous tasks are a powerfu...
James LaGrone, Ayodunni Aribuki, Cody Addison, Bar...
WIA
2001
Springer
15 years 1 months ago
Compilation Methods of Minimal Acyclic Finite-State Automata for Large Dictionaries
Abstract. We present a reflection on the evolution of the different methods for constructing minimal deterministic acyclic finite-state automata from a finite set of words. We ...
Jorge Graña, Francisco-Mario Barcala, Migue...
70
Voted
FTDCS
2003
IEEE
15 years 2 months ago
Distributed Shared State
Increasingly, Internet-level distributed systems are oriented as much toward information access as they are toward computation. From computer-supported collaborative work to peer-...
Michael L. Scott, DeQing Chen, Sandhya Dwarkadas, ...