Sciweavers

161 search results - page 16 / 33
» GCA: A Massively Parallel Model
Sort
View
TC
2008
14 years 9 months ago
Optimal and Practical Algorithms for Sorting on the PDM
Abstract. The Parallel Disks Model (PDM) has been proposed to alleviate the I/O bottleneck that arises in the processing of massive data sets. Sorting has been extensively studied ...
Sanguthevar Rajasekaran, Sandeep Sen
MIDDLEWARE
2010
Springer
14 years 8 months ago
Kevlar: A Flexible Infrastructure for Wide-Area Collaborative Applications
Abstract. While Web Services ensure interoperability and extensibility for networked applications, they also complicate the deployment of highly collaborative systems, such as virt...
Qi Huang, Daniel A. Freedman, Ymir Vigfusson, Ken ...
LCPC
2009
Springer
15 years 2 months ago
MIMD Interpretation on a GPU
Programming heterogeneous parallel computer systems is notoriously difficult, but MIMD models have proven to be portable across multi-core processors, clusters, and massively paral...
Henry G. Dietz, B. Dalton Young
JALC
2006
95views more  JALC 2006»
14 years 9 months ago
On the Decidability of Model-Checking for P Systems
Membrane computing is a branch of molecular computing that aims to develop models and paradigms that are biologically motivated. It identifies an unconventional computing model, n...
Zhe Dang, Oscar H. Ibarra, Cheng Li, Gaoyan Xie
PARLE
1992
15 years 1 months ago
Characterizing the Paralation Model using Dynamic Assignment
Collection-oriented languages provide high-level constructs for describing computations over collections. These languages are becoming increasingly popular with the advent of massi...
Eric T. Freeman, Daniel P. Friedman