Sciweavers

1156 search results - page 104 / 232
» Efficient Barriers for Distributed Shared Memory Computers
Sort
View
PERCOM
2011
ACM
13 years 2 months ago
Distributed context-aware visualization
—We present a visualization framework integrated in a context-aware system that uses a common underlying stream processing middleware for tight integration of data accessing, pro...
Harald Sanftmann, Nazario Cipriani, Daniel Weiskop...
PARLE
1993
14 years 2 months ago
On the Performance of Parallel Join Processing in Shared Nothing Database Systems
: Parallel database systems aim at providing high throughput for OLTP transactions as well as short response times for complex and data-intensive queries. Shared nothing systems re...
Robert Marek, Erhard Rahm
GRID
2004
Springer
14 years 3 months ago
Hybrid Preemptive Scheduling of MPI Applications on the Grids
— Time sharing between all the users of a Grid is a major issue in cluster and Grid integration. Classical Grid architecture involves a higher level scheduler which submits non o...
Aurelien Bouteiller, Hinde-Lilia Bouziane, Thomas ...
HPCA
2006
IEEE
14 years 10 months ago
Completely verifying memory consistency of test program executions
An important means of validating the design of commercial-grade shared memory multiprocessors is to run a large number of pseudo-random test programs on them. However, when intent...
Chaiyasit Manovit, Sudheendra Hangal
ICC
2011
IEEE
237views Communications» more  ICC 2011»
12 years 10 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