Loading...
Please wait, while we are loading the content...
Reliable Massively Parallel Symbolic Computing: Fault Tolerance for a Distributed Haskell (2013)
| Content Provider | CiteSeerX |
|---|---|
| Author | Stewart, Robert |
| Abstract | any of the information contained in it must acknowledge this thesis as the source of the quotation or information. As the number of cores in manycore systems grows exponentially, the number of failures is also predicted to grow exponentially. Hence massively parallel computations must be able to tolerate faults. Moreover new approaches to language design and system architecture are needed to address the resilience of massively parallel heterogeneous architectures. Symbolic computation has underpinned key advances in Mathematics and Computer Sci-ence, for example in number theory, cryptography, and coding theory. Computer algebra soft-ware systems facilitate symbolic mathematics. Developing these at scale has its own distinctive set of challenges, as symbolic algorithms tend to employ complex irregular data and control structures. SymGridParII is a middleware for parallel symbolic computing on massively parallel High Performance Computing platforms. A key element of SymGridParII is a domain specific language (DSL) called Haskell Distributed Parallel Haskell (HdpH). It is explicitly designed for scalable distributed-memory parallelism, and employs work stealing to load balance dynamically |
| File Format | |
| Language | English |
| Publisher Date | 2013-01-01 |
| Access Restriction | Open |
| Content Type | Text |
| Resource Type | Technical Report |
