Sciweavers

1024 search results - page 78 / 205
» Complexity and Performance in Parallel Programming Languages
Sort
View
143
Voted
SDM
2012
SIAM
297views Data Mining» more  SDM 2012»
13 years 2 months ago
A Flexible Open-Source Toolbox for Scalable Complex Graph Analysis
The Knowledge Discovery Toolbox (KDT) enables domain experts to perform complex analyses of huge datasets on supercomputers using a high-level language without grappling with the ...
Adam Lugowski, David M. Alber, Aydin Buluç,...
CC
2010
Springer
141views System Software» more  CC 2010»
15 years 7 months ago
JReq: Database Queries in Imperative Languages
Instead of writing SQL queries directly, programmers often prefer writing all their code in a general purpose programming language like Java and having their programs be automatica...
Ming-Yee Iu, Emmanuel Cecchet, Willy Zwaenepoel
101
Voted
CASES
2009
ACM
14 years 10 months ago
Spatial complexity of reversibly computable DAG
In this paper we address the issue of making a program reversible in terms of spatial complexity. Spatial complexity is the amount of memory/register locations required for perfor...
Mouad Bahi, Christine Eisenbeis
109
Voted
ESOP
2010
Springer
15 years 10 months ago
Weighted Dynamic Pushdown Networks
We develop a generic framework for the analysis of programs with recursive procedures and dynamic process creation. To this end we combine the approach of weighted pushdown systems...
Alexander Wenner
121
Voted
JAVA
2000
Springer
15 years 4 months ago
Efficient replicated method invocation in Java
We describe a new approach to object replication in Java, aimed at improving the performance of parallel programs. Our programming model allows the programmer to define groups of ...
Jason Maassen, Thilo Kielmann, Henri E. Bal