Sciweavers

156 search results - page 16 / 32
» Parallel SAT Solving using Bit-level Operations
Sort
View
IPPS
1999
IEEE
13 years 12 months ago
Improving Collective I/O Performance Using Threads
Massively parallel computers are increasingly being used to solve large, I/O intensive applications in many different fields. For such applications, the I/O requirements quite oft...
Phillip M. Dickens, Rajeev Thakur
IPPS
2006
IEEE
14 years 1 months ago
Concurrent counting is harder than queuing
In both distributed counting and queuing, processors in a distributed system issue operations which are organized into a total order. In counting, each processor receives the rank...
Srikanta Tirthapura, Costas Busch
CLUSTER
2006
IEEE
13 years 11 months ago
Lightweight I/O for Scientific Applications
Today's high-end massively parallel processing (MPP) machines have thousands to tens of thousands of processors, with next-generation systems planned to have in excess of one...
Ron Oldfield, Lee Ward, Rolf Riesen, Arthur B. Mac...
FMOODS
2007
13 years 9 months ago
Distributed Applications Implemented in Maude with Parameterized Skeletons
Abstract. Algorithmic skeletons are a well-known approach for implementing parallel and distributed applications. Declarative versions typically use higher-order functions in funct...
Adrián Riesco, Alberto Verdejo
ARTS
1997
Springer
13 years 11 months ago
PLC-Automata: A New Class of Implementable Real-Time Automata
We introduce PLC-Automata as a new class of automata which are tailored to deal with real-time properties of Programmable Logic Controllers (PLCs). These devices are often used in...
Henning Dierks