Output details
11 - Computer Science and Informatics
University of St Andrews
Output title
An efficient programming model for memory-intensive recursive algorithms using parallel disks
Type
E - Conference contribution
Name of conference/published proceedings
ISSAC 2012 : Proceedings of the 37th International Symposium on Symbolic and Algebraic Computation
Volume number
-
Issue number
-
First page of article
327
ISSN of proceedings
-
Year of publication
2012
URL
-
Number of additional authors
3
Additional information
<12>This paper reports a new, flexible and efficient programming model that allows certain types of memory-intensive computation to be adapted to use the combined hard disk resources typically found in a modern compute cluster, in place of large amounts of RAM, without significant loss of performance. To demonstrate its effectiveness, we apply it to the problem of combined determinisation and minimisation of a finite-state automaton arising from a combinatorial problem, resistant to other known techniques for this problem, and where the intermediate deterministic automaton has nearly 2 billion states.
Interdisciplinary
Yes
Cross-referral requested
-
Research group
C - Artificial intelligence
Citation count
0
Proposed double-weighted
No
Double-weighted statement
-
Reserve for a double-weighted output
No
Non-English
No
English abstract
-
