Reliable scalable symbolic computation: The design of SymGridPar2
Symbolic computation is an important area of both Mathematics and Computer Science, with many large computations that would benefit from parallel execution. Symbolic computations are, however, challenging to parallelise as they have complex data and control structures, and both dynamic and highly ir...
Saved in:
| Published in: | Computer languages, systems & structures Vol. 40; no. 1; pp. 19 - 35 |
|---|---|
| Main Authors: | , , |
| Format: | Journal Article |
| Language: | English |
| Published: |
Elsevier Ltd
01.04.2014
|
| Subjects: | |
| ISSN: | 1477-8424, 1873-6866 |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Abstract | Symbolic computation is an important area of both Mathematics and Computer Science, with many large computations that would benefit from parallel execution. Symbolic computations are, however, challenging to parallelise as they have complex data and control structures, and both dynamic and highly irregular parallelism. The SymGridPar framework (SGP) has been developed to address these challenges on small-scale parallel architectures. However the multicore revolution means that the number of cores and the number of failures are growing exponentially, and that the communication topology is becoming increasingly complex. Hence an improved parallel symbolic computation framework is required.
This paper presents the design and initial evaluation of SymGridPar2 (SGP2), a successor to SymGridPar that is designed to provide scalability onto 105 cores, and hence also provide fault tolerance. We present the SGP2 design goals, principles and architecture. We describe how scalability is achieved using layering and by allowing the programmer to control task placement. We outline how fault tolerance is provided by supervising remote computations, and outline higher-level fault tolerance abstractions.
We describe the SGP2 implementation status and development plans. We report the scalability and efficiency, including weak scaling to about 32,000 cores, and investigate the overheads of tolerating faults for simple symbolic computations.
•This paper presents the design and initial evaluation of SymGridPar2.•SymGridPar2 is designed to provide scalability and fault tolerance.•Scalability using layering and by allowing the programmer to control task placement.•We report the scalability and efficiency, including weak scaling to about 32k cores.•We present a fault tolerant work stealing protocol and measure supervision overheads. |
|---|---|
| AbstractList | Symbolic computation is an important area of both Mathematics and Computer Science, with many large computations that would benefit from parallel execution. Symbolic computations are, however, challenging to parallelise as they have complex data and control structures, and both dynamic and highly irregular parallelism. The SymGridPar framework (SGP) has been developed to address these challenges on small-scale parallel architectures. However the multicore revolution means that the number of cores and the number of failures are growing exponentially, and that the communication topology is becoming increasingly complex. Hence an improved parallel symbolic computation framework is required.
This paper presents the design and initial evaluation of SymGridPar2 (SGP2), a successor to SymGridPar that is designed to provide scalability onto 105 cores, and hence also provide fault tolerance. We present the SGP2 design goals, principles and architecture. We describe how scalability is achieved using layering and by allowing the programmer to control task placement. We outline how fault tolerance is provided by supervising remote computations, and outline higher-level fault tolerance abstractions.
We describe the SGP2 implementation status and development plans. We report the scalability and efficiency, including weak scaling to about 32,000 cores, and investigate the overheads of tolerating faults for simple symbolic computations.
•This paper presents the design and initial evaluation of SymGridPar2.•SymGridPar2 is designed to provide scalability and fault tolerance.•Scalability using layering and by allowing the programmer to control task placement.•We report the scalability and efficiency, including weak scaling to about 32k cores.•We present a fault tolerant work stealing protocol and measure supervision overheads. |
| Author | Stewart, R. Trinder, P.W. Maier, P. |
| Author_xml | – sequence: 1 givenname: P. surname: Maier fullname: Maier, P. email: Patrick.Maier@glasgow.ac.uk organization: School of Computing Science, University of Glasgow, Glasgow, UK – sequence: 2 givenname: R. surname: Stewart fullname: Stewart, R. organization: School of Mathematical and Computer Sciences, Heriot-Watt University, Edinburgh, UK – sequence: 3 givenname: P.W. orcidid: 0000-0003-0190-7010 surname: Trinder fullname: Trinder, P.W. organization: School of Computing Science, University of Glasgow, Glasgow, UK |
| BookMark | eNp9kMFKw0AQhhepYFu9e8wLJM4mm03aWynaCgVF63nZzE50yyYpu1Ho25sST4Iyh_kv3_DPN2OTtmuJsVsOCQcu7w4JuiQFLhLIEgB-waa8LLJYllJOhiyKIi5FKq7YLIQDQAqlyKds9ULO6spRFFC7MZyaqnMWI-ya42eve9u1y2j_QZGhYN_bqKuj11Oz8dY8a59es8tau0A3P3vO3h7u9-ttvHvaPK5XuxizTPZxLvIaywVqwykHYbAaKi0KTkhpzcthKqI6M1zqlKSEIpfcCJmXgFyk2mRzJse76LsQPNUK7Viu99o6xUGdRaiDQqfOIhRkahAxgPALPHrbaH_6D1mOCA0PfVnyKqClFslYT9gr09m_4W_LpHaF |
| CitedBy_id | crossref_primary_10_1016_j_entcs_2016_12_012 crossref_primary_10_1145_2775050_2633363 crossref_primary_10_1002_cpe_3746 |
| Cites_doi | 10.1007/3-540-54195-0_63 10.1017/S0956796805005526 10.1090/S0025-5718-08-02036-X 10.1007/3-540-55328-2 10.1145/1327452.1327492 10.1177/1094342006062528 10.1017/S0956796897002967 10.1145/1278177 10.1109/CCGRID.2010.49 10.1080/10586458.2001.10504443 10.1504/IJHPCN.2012.046383 10.1145/4472.4478 10.1006/jsco.1996.0126 10.1145/2500468.2500477 10.1109/MM.2003.1196112 10.1145/2096148.2034685 10.1145/5505.5508 10.1016/j.jalgebra.2008.10.024 10.1145/2480362.2480677 10.1177/1094342004046045 10.1145/359545.359563 10.1016/j.jsc.2011.12.019 10.1145/1629635.1629639 10.1109/ISPASS.2013.6557171 10.1145/1402958.1402967 10.1145/151254.151256 10.1007/978-3-642-40447-4_16 |
| ContentType | Journal Article |
| Copyright | 2014 Elsevier Ltd |
| Copyright_xml | – notice: 2014 Elsevier Ltd |
| DBID | AAYXX CITATION |
| DOI | 10.1016/j.cl.2014.03.001 |
| DatabaseName | CrossRef |
| DatabaseTitle | CrossRef |
| DatabaseTitleList | |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Computer Science |
| EISSN | 1873-6866 |
| EndPage | 35 |
| ExternalDocumentID | 10_1016_j_cl_2014_03_001 S1477842414000049 |
| GroupedDBID | --K --M .DC .~1 0R~ 1B1 1~. 1~5 29F 4.4 457 4G. 5VS 7-5 71M 8P~ AACTN AAEDT AAEDW AAIKJ AAKOC AALRI AAOAW AAQFI AAXUO AAYFN ABBOA ABMAC ABXDB ABYKQ ACDAQ ACGFS ACNNM ACRLP ACZNC ADBBV ADEZE ADJOM ADMUD AEBSH AEKER AFKWA AFTJW AGHFR AGUBO AGYEJ AHZHX AIALX AIEXJ AIKHN AITUG AJBFU AJOXV ALMA_UNASSIGNED_HOLDINGS AMFUW AMRAJ AOUOD AXJTR BKOJK BLXMC EBS EFJIC EJD EO8 EO9 EP2 EP3 FDB FEDTE FIRID FNPLU FYGXN G-Q GBLVA GBOLZ HVGLF HZ~ IHE J1W KOM M41 MO0 N9A O-L O9- OAUVE OZT P-8 P-9 PC. Q38 RIG ROL RPZ SDF SDG SDP SES SEW SPC SSV SSZ T5K TN5 XFK YYM ~G- 9DU AATTM AAXKI AAYWO AAYXX ABWVN ACLOT ACRPL ACVFH ADCNI ADNMO AEIPS AEUPX AFPUW AIGII AIIUN AKBMS AKRWK AKYEP ANKPU CITATION EFKBS ~HD |
| ID | FETCH-LOGICAL-c336t-545fc89cad1e504dcb147971ece2f18181beef3d16a2e6607561d46580c142ad3 |
| ISICitedReferencesCount | 6 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000335636200003&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 1477-8424 |
| IngestDate | Sat Nov 29 01:36:51 EST 2025 Tue Nov 18 22:42:19 EST 2025 Fri Feb 23 02:17:32 EST 2024 |
| IsDoiOpenAccess | false |
| IsOpenAccess | true |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 1 |
| Keywords | Fault tolerance Parallel functional programming Locality control |
| Language | English |
| LinkModel | OpenURL |
| MergedId | FETCHMERGED-LOGICAL-c336t-545fc89cad1e504dcb147971ece2f18181beef3d16a2e6607561d46580c142ad3 |
| ORCID | 0000-0003-0190-7010 |
| OpenAccessLink | https://www.sciencedirect.com/science/article/pii/S1477842414000049 |
| PageCount | 17 |
| ParticipantIDs | crossref_citationtrail_10_1016_j_cl_2014_03_001 crossref_primary_10_1016_j_cl_2014_03_001 elsevier_sciencedirect_doi_10_1016_j_cl_2014_03_001 |
| PublicationCentury | 2000 |
| PublicationDate | 2014-04-01 |
| PublicationDateYYYYMMDD | 2014-04-01 |
| PublicationDate_xml | – month: 04 year: 2014 text: 2014-04-01 day: 01 |
| PublicationDecade | 2010 |
| PublicationTitle | Computer languages, systems & structures |
| PublicationYear | 2014 |
| Publisher | Elsevier Ltd |
| Publisher_xml | – name: Elsevier Ltd |
| References | Lamport (bib22) 1978; 21 Maza MM, Watt SM, editors. PASCO 2007: proceedings of the international workshop on parallel symbolic computation. London, Ontario, Canada: ACM Press; 2007. Haskell distributed parallel Haskell. Repository. Barroso, Dean, Hölzle (bib5) 2003; 23 GAP Group. GAP—groups, algorithms, and programming; 2007. Davidson, Garcia-Molina, Skeen (bib12) 1985; 17 Schneider (bib34) 1993; 25 Küchlin W. PARSAC-2: a parallel SAC-2 based on threads. In: AAECC-8. Lecture notes in computer science, vol. 508. Tokyo, Japan: Springer; 1991. p. 341–53. Linton, Hammond, Konovalov, Brown, Trinder, Loidl (bib23) 2013; 49 Coutts D, Wu N, de Vries E. Network-transport: network abstraction layer. Haskell library. Lameter (bib21) 2013; 56 Message Passing Interface Forum. MPI: a message passing interface standard. Int J Supercomput Appl 1994;8(3/4):165–414. Char, Geddes, Gonnet, Leong, Monagan, Watt (bib7) 1995 Stewart R. Reliable massively parallel symbolic computing: fault tolerance for a distributed Haskell [Ph.D thesis]. School of Mathematical and Computer Sciences, Heriot-Watt University; 2013. Maier P. HPC-GAP case study: finding matrices of invariant bilinear forms in the representation theory of Hecke algebras. Technical Report HW-MACS-TR-0102. Heriot-Watt University; 2013. Janjic V, Hammond K. Granularity-aware work-stealing for computationally-uniform Grids. In: CCGrid 2010. Melbourne, Australia: IEEE; 2010. p. 123–34. Maier P, Trinder PW. Implementing a high-level distributed-memory parallel Haskell in Haskell. In: IFL 2011. Lecture notes in computer science, vol. 7257. Lawrence, Kansas, USA: Springer; 2012. p. 35–50. Stewart R, Trinder PW, Maier P. Supervised workpools for reliable massively parallel computing. In: TFP 2012. Lecture notes in computer science, vol. 7829. St Andrews, UK: Springer; 2013. p. 247–62. Daberkow, Fieker, Klüners, Pohst, Roegner, Schörnig (bib11) 1997; 24 Maier P, Stewart R, Trinder PW. Reliable scalable symbolic computation: the design of SymGridPar2. In: SAC 2013. Coimbra, Portugal: ACM Press; 2013. p. 1674–81. Cooperman G. Parallel GAP: mature interactive parallel computing. In: Groups and computation, III. Columbus, OH; 1999. p. 123–38 [De Gruyter, 2001]. Borwein, Ferguson, Mossinghoff (bib6) 2008; 77 Al Zain, Trinder, Hammond (bib3) 2012; 7 Aswad, Trinder, Loidl (bib4) 2012; 9 Marlow S, Newton R, Peyton Jones SL. A monad for deterministic parallelism. In: Haskell 2011. Tokyo, Japan: ACM Press; 2011. p. 71–82. Al-Fares M, Loukissas A, Vahdat A. A scalable, commodity data center network architecture. In: SIGCOMM 2008. Seattle, WA, USA: ACM Press; 2008. p. 63–74. Zippel R, editor. CAP ׳90: proceedings of the second international workshop on computer algebra and parallelism. Lecture notes in computer science, vol. 584. Cornell, Ithaca, NY, USA: Springer; 1992. Lübeck, Neunhöffer (bib25) 2001; 10 Wrzesinska, van Nieuwpoort, Maassen, Kielmann, Bal (bib38) 2006; 20 . Loogen, Ortega-Mallén, Peña-Marí (bib24) 2005; 15 Trinder, Hammond, Loidl, Peyton Jones (bib37) 1998; 8 Geck, Müller (bib15) 2009; 321 Dean, Ghemawat (bib13) 2008; 51 Halstead (bib17) 1985; 7 The OpenMath standard, version 2.0; 2012. Cole (bib8) 1989 Saravanan KP, Carpenter PM, Ramirez A. Power/performance evaluation of energy efficient ethernet (EEE) for high performance computing. In: ISPASS 2013. Austin, TX, USA: IEEE; 2013. p. 205–14. Gropp, Lusk (bib16) 2004; 18 Al Zain A, Hammond K, Berthold J, Trinder PW, Michaelson G, Aswad M. Low-pain, high-gain multicore programming in Haskell: coordinating irregular symbolic computations on multicore architectures. In: DAMP 2009. Savannah, GA, USA: ACM Press; 2009. p. 25–36. Gropp (10.1016/j.cl.2014.03.001_bib16) 2004; 18 10.1016/j.cl.2014.03.001_bib28 Cole (10.1016/j.cl.2014.03.001_bib8) 1989 10.1016/j.cl.2014.03.001_bib29 Wrzesinska (10.1016/j.cl.2014.03.001_bib38) 2006; 20 Lübeck (10.1016/j.cl.2014.03.001_bib25) 2001; 10 Dean (10.1016/j.cl.2014.03.001_bib13) 2008; 51 Lameter (10.1016/j.cl.2014.03.001_bib21) 2013; 56 10.1016/j.cl.2014.03.001_bib2 10.1016/j.cl.2014.03.001_bib9 Halstead (10.1016/j.cl.2014.03.001_bib17) 1985; 7 Schneider (10.1016/j.cl.2014.03.001_bib34) 1993; 25 10.1016/j.cl.2014.03.001_bib20 Barroso (10.1016/j.cl.2014.03.001_bib5) 2003; 23 Lamport (10.1016/j.cl.2014.03.001_bib22) 1978; 21 10.1016/j.cl.2014.03.001_bib26 10.1016/j.cl.2014.03.001_bib1 Aswad (10.1016/j.cl.2014.03.001_bib4) 2012; 9 10.1016/j.cl.2014.03.001_bib27 Davidson (10.1016/j.cl.2014.03.001_bib12) 1985; 17 10.1016/j.cl.2014.03.001_bib19 10.1016/j.cl.2014.03.001_bib39 10.1016/j.cl.2014.03.001_bib18 Loogen (10.1016/j.cl.2014.03.001_bib24) 2005; 15 Daberkow (10.1016/j.cl.2014.03.001_bib11) 1997; 24 Geck (10.1016/j.cl.2014.03.001_bib15) 2009; 321 Linton (10.1016/j.cl.2014.03.001_bib23) 2013; 49 Borwein (10.1016/j.cl.2014.03.001_bib6) 2008; 77 10.1016/j.cl.2014.03.001_bib30 Char (10.1016/j.cl.2014.03.001_bib7) 1995 10.1016/j.cl.2014.03.001_bib33 Trinder (10.1016/j.cl.2014.03.001_bib37) 1998; 8 10.1016/j.cl.2014.03.001_bib31 10.1016/j.cl.2014.03.001_bib10 10.1016/j.cl.2014.03.001_bib32 Al Zain (10.1016/j.cl.2014.03.001_bib3) 2012; 7 10.1016/j.cl.2014.03.001_bib35 10.1016/j.cl.2014.03.001_bib14 10.1016/j.cl.2014.03.001_bib36 |
| References_xml | – year: 1989 ident: bib8 article-title: Algorithmic skeletons: structured management of parallel computation – reference: Saravanan KP, Carpenter PM, Ramirez A. Power/performance evaluation of energy efficient ethernet (EEE) for high performance computing. In: ISPASS 2013. Austin, TX, USA: IEEE; 2013. p. 205–14. – volume: 17 start-page: 341 year: 1985 end-page: 370 ident: bib12 article-title: Consistency in partitioned networks publication-title: ACM Comput Surv – volume: 25 start-page: 45 year: 1993 end-page: 67 ident: bib34 article-title: Self-stabilization publication-title: ACM Comput Surv – volume: 23 start-page: 22 year: 2003 end-page: 28 ident: bib5 article-title: Web search for a planet publication-title: IEEE Micro – volume: 15 start-page: 431 year: 2005 end-page: 475 ident: bib24 article-title: Parallel functional programming in Eden publication-title: J Funct Program – volume: 8 start-page: 23 year: 1998 end-page: 60 ident: bib37 article-title: Algorithm + strategy=parallelism publication-title: J Funct Program – volume: 20 start-page: 103 year: 2006 end-page: 114 ident: bib38 article-title: Fault-tolerant scheduling of fine-grained tasks in Grid environments publication-title: Int J High Perform Comput Appl – reference: Cooperman G. Parallel GAP: mature interactive parallel computing. In: Groups and computation, III. Columbus, OH; 1999. p. 123–38 [De Gruyter, 2001]. – volume: 10 start-page: 197 year: 2001 end-page: 205 ident: bib25 article-title: Enumerating large orbits and direct condensation publication-title: Exp Math – volume: 7 start-page: 76 year: 2012 end-page: 86 ident: bib3 article-title: Orchestrating computational algebra components into a high-performance parallel system publication-title: Int J High Perform Comput Netw – reference: Janjic V, Hammond K. Granularity-aware work-stealing for computationally-uniform Grids. In: CCGrid 2010. Melbourne, Australia: IEEE; 2010. p. 123–34. – reference: Maier P, Stewart R, Trinder PW. Reliable scalable symbolic computation: the design of SymGridPar2. In: SAC 2013. Coimbra, Portugal: ACM Press; 2013. p. 1674–81. – volume: 51 start-page: 107 year: 2008 end-page: 113 ident: bib13 article-title: MapReduce publication-title: Commun ACM – reference: Haskell distributed parallel Haskell. Repository. 〈 – reference: Marlow S, Newton R, Peyton Jones SL. A monad for deterministic parallelism. In: Haskell 2011. Tokyo, Japan: ACM Press; 2011. p. 71–82. – reference: Message Passing Interface Forum. MPI: a message passing interface standard. Int J Supercomput Appl 1994;8(3/4):165–414. – reference: Zippel R, editor. CAP ׳90: proceedings of the second international workshop on computer algebra and parallelism. Lecture notes in computer science, vol. 584. Cornell, Ithaca, NY, USA: Springer; 1992. – volume: 24 start-page: 267 year: 1997 end-page: 283 ident: bib11 article-title: KANT V4 publication-title: J Symb Comput – volume: 21 start-page: 558 year: 1978 end-page: 565 ident: bib22 article-title: Time, clocks, and the ordering of events in a distributed system publication-title: Commun ACM – reference: 〉. – volume: 49 start-page: 19 year: 2013 end-page: 95 ident: bib23 article-title: Easy composition of symbolic computation software using SCSCP publication-title: J Symb Comput – reference: Maier P. HPC-GAP case study: finding matrices of invariant bilinear forms in the representation theory of Hecke algebras. Technical Report HW-MACS-TR-0102. Heriot-Watt University; 2013. – reference: GAP Group. GAP—groups, algorithms, and programming; 2007. 〈 – volume: 321 start-page: 3274 year: 2009 end-page: 3298 ident: bib15 article-title: James׳ conjecture for Hecke algebras of exceptional type, I publication-title: J Algebr – reference: Stewart R. Reliable massively parallel symbolic computing: fault tolerance for a distributed Haskell [Ph.D thesis]. School of Mathematical and Computer Sciences, Heriot-Watt University; 2013. – year: 1995, ident: bib7 article-title: Maple V language reference manual – reference: Maier P, Trinder PW. Implementing a high-level distributed-memory parallel Haskell in Haskell. In: IFL 2011. Lecture notes in computer science, vol. 7257. Lawrence, Kansas, USA: Springer; 2012. p. 35–50. – volume: 77 start-page: 1681 year: 2008 end-page: 1694 ident: bib6 article-title: Sign changes in sums of the Liouville function publication-title: Math Comput – volume: 9 start-page: 1807 year: 2012 end-page: 1816 ident: bib4 article-title: Architecture aware parallel programming in Glasgow Parallel Haskell (GPH) publication-title: Procedia CS – volume: 18 start-page: 363 year: 2004 end-page: 372 ident: bib16 article-title: Fault tolerance in message passing interface programs publication-title: Int J High Perform Comput Appl – reference: Coutts D, Wu N, de Vries E. Network-transport: network abstraction layer. Haskell library. 〈 – volume: 7 start-page: 501 year: 1985 end-page: 538 ident: bib17 article-title: Multilisp publication-title: ACM Trans Program Lang Syst – reference: Al-Fares M, Loukissas A, Vahdat A. A scalable, commodity data center network architecture. In: SIGCOMM 2008. Seattle, WA, USA: ACM Press; 2008. p. 63–74. – reference: Stewart R, Trinder PW, Maier P. Supervised workpools for reliable massively parallel computing. In: TFP 2012. Lecture notes in computer science, vol. 7829. St Andrews, UK: Springer; 2013. p. 247–62. – reference: Al Zain A, Hammond K, Berthold J, Trinder PW, Michaelson G, Aswad M. Low-pain, high-gain multicore programming in Haskell: coordinating irregular symbolic computations on multicore architectures. In: DAMP 2009. Savannah, GA, USA: ACM Press; 2009. p. 25–36. – volume: 56 start-page: 54 year: 2013 end-page: 59 ident: bib21 article-title: An overview of non-uniform memory access publication-title: Commun ACM – reference: The OpenMath standard, version 2.0; 2012. 〈 – reference: Maza MM, Watt SM, editors. PASCO 2007: proceedings of the international workshop on parallel symbolic computation. London, Ontario, Canada: ACM Press; 2007. – reference: Küchlin W. PARSAC-2: a parallel SAC-2 based on threads. In: AAECC-8. Lecture notes in computer science, vol. 508. Tokyo, Japan: Springer; 1991. p. 341–53. – ident: 10.1016/j.cl.2014.03.001_bib20 doi: 10.1007/3-540-54195-0_63 – volume: 15 start-page: 431 issue: 3 year: 2005 ident: 10.1016/j.cl.2014.03.001_bib24 article-title: Parallel functional programming in Eden publication-title: J Funct Program doi: 10.1017/S0956796805005526 – ident: 10.1016/j.cl.2014.03.001_bib31 – ident: 10.1016/j.cl.2014.03.001_bib14 – ident: 10.1016/j.cl.2014.03.001_bib10 – year: 1995 ident: 10.1016/j.cl.2014.03.001_bib7 – volume: 77 start-page: 1681 issue: 263 year: 2008 ident: 10.1016/j.cl.2014.03.001_bib6 article-title: Sign changes in sums of the Liouville function publication-title: Math Comput doi: 10.1090/S0025-5718-08-02036-X – ident: 10.1016/j.cl.2014.03.001_bib39 doi: 10.1007/3-540-55328-2 – volume: 51 start-page: 107 issue: 1 year: 2008 ident: 10.1016/j.cl.2014.03.001_bib13 article-title: MapReduce publication-title: Commun ACM doi: 10.1145/1327452.1327492 – volume: 20 start-page: 103 issue: 1 year: 2006 ident: 10.1016/j.cl.2014.03.001_bib38 article-title: Fault-tolerant scheduling of fine-grained tasks in Grid environments publication-title: Int J High Perform Comput Appl doi: 10.1177/1094342006062528 – volume: 8 start-page: 23 issue: 1 year: 1998 ident: 10.1016/j.cl.2014.03.001_bib37 article-title: Algorithm + strategy=parallelism publication-title: J Funct Program doi: 10.1017/S0956796897002967 – ident: 10.1016/j.cl.2014.03.001_bib30 doi: 10.1145/1278177 – ident: 10.1016/j.cl.2014.03.001_bib19 doi: 10.1109/CCGRID.2010.49 – ident: 10.1016/j.cl.2014.03.001_bib9 – volume: 10 start-page: 197 issue: 2 year: 2001 ident: 10.1016/j.cl.2014.03.001_bib25 article-title: Enumerating large orbits and direct condensation publication-title: Exp Math doi: 10.1080/10586458.2001.10504443 – ident: 10.1016/j.cl.2014.03.001_bib32 – ident: 10.1016/j.cl.2014.03.001_bib26 – ident: 10.1016/j.cl.2014.03.001_bib28 – volume: 7 start-page: 76 issue: 2 year: 2012 ident: 10.1016/j.cl.2014.03.001_bib3 article-title: Orchestrating computational algebra components into a high-performance parallel system publication-title: Int J High Perform Comput Netw doi: 10.1504/IJHPCN.2012.046383 – volume: 7 start-page: 501 issue: 4 year: 1985 ident: 10.1016/j.cl.2014.03.001_bib17 article-title: Multilisp publication-title: ACM Trans Program Lang Syst doi: 10.1145/4472.4478 – volume: 24 start-page: 267 issue: 3/4 year: 1997 ident: 10.1016/j.cl.2014.03.001_bib11 article-title: KANT V4 publication-title: J Symb Comput doi: 10.1006/jsco.1996.0126 – ident: 10.1016/j.cl.2014.03.001_bib36 – volume: 56 start-page: 54 issue: 9 year: 2013 ident: 10.1016/j.cl.2014.03.001_bib21 article-title: An overview of non-uniform memory access publication-title: Commun ACM doi: 10.1145/2500468.2500477 – volume: 23 start-page: 22 issue: 2 year: 2003 ident: 10.1016/j.cl.2014.03.001_bib5 article-title: Web search for a planet publication-title: IEEE Micro doi: 10.1109/MM.2003.1196112 – ident: 10.1016/j.cl.2014.03.001_bib29 doi: 10.1145/2096148.2034685 – volume: 17 start-page: 341 issue: 3 year: 1985 ident: 10.1016/j.cl.2014.03.001_bib12 article-title: Consistency in partitioned networks publication-title: ACM Comput Surv doi: 10.1145/5505.5508 – ident: 10.1016/j.cl.2014.03.001_bib18 – volume: 321 start-page: 3274 issue: 11 year: 2009 ident: 10.1016/j.cl.2014.03.001_bib15 article-title: James׳ conjecture for Hecke algebras of exceptional type, I publication-title: J Algebr doi: 10.1016/j.jalgebra.2008.10.024 – ident: 10.1016/j.cl.2014.03.001_bib27 doi: 10.1145/2480362.2480677 – volume: 18 start-page: 363 issue: 3 year: 2004 ident: 10.1016/j.cl.2014.03.001_bib16 article-title: Fault tolerance in message passing interface programs publication-title: Int J High Perform Comput Appl doi: 10.1177/1094342004046045 – volume: 21 start-page: 558 issue: 7 year: 1978 ident: 10.1016/j.cl.2014.03.001_bib22 article-title: Time, clocks, and the ordering of events in a distributed system publication-title: Commun ACM doi: 10.1145/359545.359563 – volume: 9 start-page: 1807 year: 2012 ident: 10.1016/j.cl.2014.03.001_bib4 article-title: Architecture aware parallel programming in Glasgow Parallel Haskell (GPH) publication-title: Procedia CS – volume: 49 start-page: 19 year: 2013 ident: 10.1016/j.cl.2014.03.001_bib23 article-title: Easy composition of symbolic computation software using SCSCP publication-title: J Symb Comput doi: 10.1016/j.jsc.2011.12.019 – ident: 10.1016/j.cl.2014.03.001_bib2 doi: 10.1145/1629635.1629639 – ident: 10.1016/j.cl.2014.03.001_bib33 doi: 10.1109/ISPASS.2013.6557171 – ident: 10.1016/j.cl.2014.03.001_bib1 doi: 10.1145/1402958.1402967 – volume: 25 start-page: 45 issue: 1 year: 1993 ident: 10.1016/j.cl.2014.03.001_bib34 article-title: Self-stabilization publication-title: ACM Comput Surv doi: 10.1145/151254.151256 – ident: 10.1016/j.cl.2014.03.001_bib35 doi: 10.1007/978-3-642-40447-4_16 – year: 1989 ident: 10.1016/j.cl.2014.03.001_bib8 |
| SSID | ssj0020845 |
| Score | 1.9701203 |
| Snippet | Symbolic computation is an important area of both Mathematics and Computer Science, with many large computations that would benefit from parallel execution.... |
| SourceID | crossref elsevier |
| SourceType | Enrichment Source Index Database Publisher |
| StartPage | 19 |
| SubjectTerms | Fault tolerance Locality control Parallel functional programming |
| Title | Reliable scalable symbolic computation: The design of SymGridPar2 |
| URI | https://dx.doi.org/10.1016/j.cl.2014.03.001 |
| Volume | 40 |
| WOSCitedRecordID | wos000335636200003&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| journalDatabaseRights | – providerCode: PRVESC databaseName: Elsevier SD Freedom Collection Journals 2021 customDbUrl: eissn: 1873-6866 dateEnd: 20181231 omitProxy: false ssIdentifier: ssj0020845 issn: 1477-8424 databaseCode: AIEXJ dateStart: 20020401 isFulltext: true titleUrlDefault: https://www.sciencedirect.com providerName: Elsevier |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV1Lb9NAEF6FlAMXKC-1PKo9cOHg4Fd2171FqLQgqCIURG7Weh9SqtStnLRq_31nn3GBInrgYlkr27F3vsx-O_vNLELvdJMLxtQ4oUSppOQ6TZqx1omQRNFSwgxaWUt_pcfHbD6vpoOBDrkwl0vatuzqqjr_r6aGNjC2SZ29h7njQ6EBzsHocASzw_GfDG9ExjYfagXd706uTxtT_tfqxy_WUc9hICKtgsOmrlyfHnYLOeVd3mesYduHGNm0hncFoFcWOK4E7UW3USN-4wuHhOkoRnBMkM6lB32PjbPOFGv0V_4c9SMQWV-44pxmSWGkK10udPCqrgjTLfQ4F-k9pBtsXamS39y4iyicjIRZHMpKV4Y22wxZYZn-l5Es6guDdO2kFsvaPKFOC6Pee4C2cjqu2BBtTT4fzL_EqXnK7HbW8Uv8grZTAt5-iz8TmB4pmW2jx342gScOBU_RQLXP0JNgMuwd93M0CaDAARQ4gAL3QLGPARLYQQKfadyDxAv049PB7ONR4jfPSERRkHUCzFgLVgkuMzVOSyka-LiKZkqoXAOtg-mKUrqQGeG5IgSYI8lkCXw0FVmZc1m8RMP2rFU7CDOpgdVyqhohS0oE5zQXpCDK1kaq2C76EHqkFr6yvNngZFnfZYdd9D7ece6qqvzl2iJ0cu1ZoWN7NaDlzrte3eMXXqNHG1i_QUP416i36KG4XC9W3Z6Hyg2ZKH92 |
| linkProvider | Elsevier |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Reliable+scalable+symbolic+computation%3A+The+design+of+SymGridPar2&rft.jtitle=Computer+languages%2C+systems+%26+structures&rft.au=Maier%2C+P.&rft.au=Stewart%2C+R.&rft.au=Trinder%2C+P.W.&rft.date=2014-04-01&rft.issn=1477-8424&rft.volume=40&rft.issue=1&rft.spage=19&rft.epage=35&rft_id=info:doi/10.1016%2Fj.cl.2014.03.001&rft.externalDBID=n%2Fa&rft.externalDocID=10_1016_j_cl_2014_03_001 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1477-8424&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1477-8424&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1477-8424&client=summon |