OOPSLA
2010
Springer
13 years 2 months ago
2010
Springer
As heterogeneous parallel systems become dominant, application developers are being forced to turn to an incompatible mix of low level programming models (e.g. OpenMP, MPI, CUDA, ...
ICFEM
2010
Springer
13 years 2 months ago
2010
Springer
Despite the advancements of concurrency theory in the past decades, practical concurrent programming has remained a challenging activity. Fundamental problems such as data races an...
CORR
2010
Springer
13 years 3 months ago
2010
Springer
The persistent programming systems of the 1980s offered a programming model that integrated computation and long-term storage. In these systems, reliable applications could be eng...
EOR
2006
13 years 4 months ago
2006
: This paper addresses the problem of computing minimum risk paths by taking as objective the expected accident cost. The computation is based on a dynamic programming formulation ...
HPDC
2010
IEEE
13 years 5 months ago
2010
IEEE
MapReduce programming model has simplified the implementation of many data parallel applications. The simplicity of the programming model and the quality of services provided by m...
WSC
1997
13 years 5 months ago
1997
Components of modern parallel systems are becoming quite complex with many features and variations. An integrated modeling of these components (interconnection network, messaging ...
WOA
2000
13 years 5 months ago
2000
ogramming are evaluated along three different guidelines: the programming abstractions the calculus suggests; the underlying programming model; the security mechanisms provided. Th...
PDPTA
2003
13 years 5 months ago
2003
The paper begins by considering what a Grid Computing Environment might be, why it is demanded, and how the authors’ HPspmd programming fits into this picture. We then review o...
ERSA
2006
13 years 5 months ago
2006
In this paper we first outline and discuss the issues of currently accepted computational models for hybrid CPU/FPGA systems. Then, we discuss the need for researchers to develop ...
FMOODS
2008
13 years 5 months ago
2008
Reasoning about object-oriented programs is hard, due to , dynamic binding and the need for data abstraction and framing. Reasoning about concurrent object-oriented programs is eve...