Sciweavers

11 search results - page 1 / 3
» Pipelined Decomposable BSP Computers
Sort
View
SOFSEM
2001
Springer
13 years 10 months ago
Pipelined Decomposable BSP Computers
The class of weak parallel machines is interesting, because it contains some realistic parallel machine models, especially suitable for pipelined computations. We prove that a modi...
Martin Beran
ICCS
2001
Springer
13 years 10 months ago
On the Effectiveness of D-BSP as a Bridging Model of Parallel Computation
This paper surveys and places into perspective a number of results concerning the D-BSP (Decomposable Bulk Synchronous Parallel) model of computation, a variant of the popular BSP ...
Gianfranco Bilardi, Carlo Fantozzi, Andrea Pietrac...
IPPS
2007
IEEE
14 years 15 days ago
Network-Oblivious Algorithms
The design of algorithms that can run unchanged yet efficiently on a variety of machines characterized by different degrees of parallelism and communication capabilities is a hig...
Gianfranco Bilardi, Andrea Pietracaprina, Geppino ...
IPPS
2006
IEEE
14 years 6 days ago
Cache-oblivious simulation of parallel programs
This paper explores the relation between the structured parallelism exposed by the Decomposable BSP (DBSP) model through submachine locality and locality of reference in multi-lev...
Andrea Pietracaprina, Geppino Pucci, Francesco Sil...
ACL
2006
13 years 7 months ago
A Pipeline Framework for Dependency Parsing
Pipeline computation, in which a task is decomposed into several stages that are solved sequentially, is a common computational strategy in natural language processing. The key pr...
Ming-Wei Chang, Quang Do, Dan Roth