Sciweavers

608 search results - page 75 / 122
» The Expressive Power of Simple Parallelism
Sort
View
JAC
2008
14 years 11 months ago
Rule 110: universality and catenations
Cellular automata are a simple model of parallel computation. Many people wonder about the computing power of such a model. Following an idea of S. Wolfram [16], M. Cook [3] has pr...
Gaétan Richard
SIGMOD
2007
ACM
190views Database» more  SIGMOD 2007»
15 years 10 months ago
Map-reduce-merge: simplified relational data processing on large clusters
Map-Reduce is a programming model that enables easy development of scalable parallel applications to process vast amounts of data on large clusters of commodity machines. Through ...
Hung-chih Yang, Ali Dasdan, Ruey-Lung Hsiao, Dougl...
IEEEPACT
2008
IEEE
15 years 4 months ago
Exploiting loop-dependent stream reuse for stream processors
The memory access limits the performance of stream processors. By exploiting the reuse of data held in the Stream Register File (SRF), an on-chip storage, the number of memory acc...
Xuejun Yang, Ying Zhang, Jingling Xue, Ian Rogers,...
ICPPW
2005
IEEE
15 years 3 months ago
Matchmaking, Datasets and Physics Analysis
Grid enabled physics analysis requires a Workload Management System (WMS) that takes care of finding suitable computing resources to execute data intensive jobs. A typical exampl...
Heinz Stockinger, Flavia Donno, Giulio Eulisse, Mi...
IPPS
2000
IEEE
15 years 2 months ago
Monotonic Counters: A New Mechanism for Thread Synchronization
Only a handful of fundamental mechanisms for synchronizing the access of concurrent threads to shared memory are widely implemented and used. These include locks, condition variab...
John Thornley, K. Mani Chandy