Sciweavers

2432 search results - page 151 / 487
» Using simple abstraction to reinvent computing for paralleli...
Sort
View
HPCA
1999
IEEE
15 years 8 months ago
Improving the Accuracy vs. Speed Tradeoff for Simulating Shared-Memory Multiprocessors with ILP Processors
Previous simulators for shared-memory architectures have imposed a large tradeoff between simulation accuracy and speed. Most such simulators model simple processors that do not e...
Murthy Durbhakula, Vijay S. Pai, Sarita V. Adve
123
Voted
CONCUR
1998
Springer
15 years 8 months ago
The Regular Viewpoint on PA-Processes
PA is the process algebra allowing non-determinism, sequential and parallel compositions, and recursion. We suggest viewing PA-processes as trees, and using treeautomata technique...
Denis Lugiez, Ph. Schnoebelen
ICPP
1993
IEEE
15 years 8 months ago
A Concurrent Dynamic Task Graph
Task graphs are used for scheduling tasks on parallel processors when the tasks have dependencies. If the execution of the program is known ahead of time, then the tasks can be st...
Theodore Johnson
SPDP
1993
IEEE
15 years 8 months ago
The Meerkat Multicomputer
Meerkat is a distributed memory multicomputer architecture that scales to hundreds of processors. Meerkat uses a two dimensional passive backplane to connect nodes composed of pro...
Robert C. Bedichek, Curtis Brown
HPCA
2011
IEEE
14 years 8 months ago
Bloom Filter Guided Transaction Scheduling
Contention management is an important design component to a transactional memory system. Without effective contention management to ensure forward progress, a transactional memory...
Geoffrey Blake, Ronald G. Dreslinski, Trevor N. Mu...