11 search results - page 1 / 3 » Pipelined Decomposable BSP Computers |
SOFSEM
2001
Springer
13 years 12 months ago
2001
Springer
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...
ICCS
2001
Springer
13 years 12 months ago
2001
Springer
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 ...
IPPS
2007
IEEE
14 years 1 months ago
2007
IEEE
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...
IPPS
2006
IEEE
14 years 1 months ago
2006
IEEE
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...
ACL
2006
13 years 8 months ago
2006
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...