Executable Specification Language for Parallel Symbolic Computation
Two goals, simplicity of program designing, and efficiency of its computation, al- ways remain topical in programming, and more than anything this is true about parallel programming systems. The former goal is usually achieved for declar- ative programming languages, the latter - by embedding of coo...
Gespeichert in:
| Hauptverfasser: | , |
|---|---|
| Format: | Buchkapitel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 757 |
|---|---|
| container_issue | |
| container_start_page | 754 |
| container_title | |
| container_volume | 1900 |
| creator | Godlevsky, Alexander B. Hluchý, Ladislav |
| description | Two goals, simplicity of program designing, and efficiency of its computation, al- ways remain topical in programming, and more than anything this is true about parallel programming systems. The former goal is usually achieved for declar- ative programming languages, the latter - by embedding of coordination level operators. One of the earliest such extensions, future annotation, isa proposed in [3]. Their use allows to start a function computation before the moment when computation of its annotated arguments will be completed. Another advance to increase program parallelization was using of nondeterministic operators in pseudo-functional languages [5]. One more resource widely used in logic pro- gramming to program parallelization is speculative computation of alternative branches. |
| doi_str_mv | 10.1007/3-540-44520-X_103 |
| format | Book Chapter |
| fullrecord | <record><control><sourceid>proquest_pasca</sourceid><recordid>TN_cdi_pascalfrancis_primary_1383184</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>EBC3071624_107_786</sourcerecordid><originalsourceid>FETCH-LOGICAL-p312t-296d6f0adf293527d764c4f24e88ebef62f56eec3fd086618944c3b9902a5a1f3</originalsourceid><addsrcrecordid>eNo9kElPwzAQhc0qotIfwC0HrqG2x-sRVWWRKoFUkLhZjmuXQJqEOJXov8ddxFxGmvfeaOZD6IbgO4KxnEDBGS4Y4xQXH4ZgOEFjLRWk6X4IpygjgpACgOmzf01IzQU5RxkGTAstGVyiTHPFiVaKX6FxjF84FVCqNc7QdPbr3WawZe3zReddFSpnh6pt8rltVhu78nlo-_zV9raufZ0vtuuyrSuXT9t1l3I76zW6CLaOfnzsI_T-MHubPhXzl8fn6f286IDQoaBaLEXAdhmoBk7lUgrmWKDMK-VLHwQNXHjvICyxEoIozZiDMp1JLbckwAjdHvZ2Njpbh942roqm66u17beGgAKiWLJNDraYlGble1O27XdMDM2OrAGTOJk9RLMnmxLsuLhvfzY-DsbvIs43Q3rbfdpu8H00gCURlKWINFIJ-AMO53Ys</addsrcrecordid><sourcetype>Index Database</sourcetype><iscdi>true</iscdi><recordtype>book_chapter</recordtype><pqid>EBC3071624_107_786</pqid></control><display><type>book_chapter</type><title>Executable Specification Language for Parallel Symbolic Computation</title><source>Springer Books</source><creator>Godlevsky, Alexander B. ; Hluchý, Ladislav</creator><contributor>Bode, Arndt ; Karl, Wolfgang ; Ludwig, Thomas ; Wismüller, Roland ; Bode, Arndt ; Ludwig, Thomas ; Karl, Wolfgang ; Wismüller, Roland</contributor><creatorcontrib>Godlevsky, Alexander B. ; Hluchý, Ladislav ; Bode, Arndt ; Karl, Wolfgang ; Ludwig, Thomas ; Wismüller, Roland ; Bode, Arndt ; Ludwig, Thomas ; Karl, Wolfgang ; Wismüller, Roland</creatorcontrib><description>Two goals, simplicity of program designing, and efficiency of its computation, al- ways remain topical in programming, and more than anything this is true about parallel programming systems. The former goal is usually achieved for declar- ative programming languages, the latter - by embedding of coordination level operators. One of the earliest such extensions, future annotation, isa proposed in [3]. Their use allows to start a function computation before the moment when computation of its annotated arguments will be completed. Another advance to increase program parallelization was using of nondeterministic operators in pseudo-functional languages [5]. One more resource widely used in logic pro- gramming to program parallelization is speculative computation of alternative branches.</description><identifier>ISSN: 0302-9743</identifier><identifier>ISBN: 9783540679561</identifier><identifier>ISBN: 3540679561</identifier><identifier>EISSN: 1611-3349</identifier><identifier>EISBN: 9783540445203</identifier><identifier>EISBN: 354044520X</identifier><identifier>DOI: 10.1007/3-540-44520-X_103</identifier><identifier>OCLC: 958519885</identifier><identifier>LCCallNum: TK7885-7895</identifier><language>eng</language><publisher>Germany: Springer Berlin / Heidelberg</publisher><subject>Algorithmic Skeleton ; Applied sciences ; Exact sciences and technology ; Functional Language ; Mathematics ; Methods of scientific computing (including symbolic computation, algebraic computation) ; Numerical analysis. Scientific computation ; Operational research and scientific management ; Operational research. Management science ; Optimization. Search problems ; Program Transformation ; Sciences and techniques of general use ; Semantic Declaration ; Transition Rule</subject><ispartof>Euro-Par 2000 Parallel Processing, 2000, Vol.1900, p.754-757</ispartof><rights>Springer-Verlag Berlin Heidelberg 2000</rights><rights>2000 INIST-CNRS</rights><lds50>peer_reviewed</lds50><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed><relation>Lecture Notes in Computer Science</relation></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Uhttps://ebookcentral.proquest.com/covers/3071624-l.jpg</thumbnail><linktopdf>$$Uhttps://link.springer.com/content/pdf/10.1007/3-540-44520-X_103$$EPDF$$P50$$Gspringer$$H</linktopdf><linktohtml>$$Uhttps://link.springer.com/10.1007/3-540-44520-X_103$$EHTML$$P50$$Gspringer$$H</linktohtml><link.rule.ids>309,310,775,776,780,785,786,789,4035,4036,27904,38234,41421,42490</link.rule.ids><backlink>$$Uhttp://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=1383184$$DView record in Pascal Francis$$Hfree_for_read</backlink></links><search><contributor>Bode, Arndt</contributor><contributor>Karl, Wolfgang</contributor><contributor>Ludwig, Thomas</contributor><contributor>Wismüller, Roland</contributor><contributor>Bode, Arndt</contributor><contributor>Ludwig, Thomas</contributor><contributor>Karl, Wolfgang</contributor><contributor>Wismüller, Roland</contributor><creatorcontrib>Godlevsky, Alexander B.</creatorcontrib><creatorcontrib>Hluchý, Ladislav</creatorcontrib><title>Executable Specification Language for Parallel Symbolic Computation</title><title>Euro-Par 2000 Parallel Processing</title><description>Two goals, simplicity of program designing, and efficiency of its computation, al- ways remain topical in programming, and more than anything this is true about parallel programming systems. The former goal is usually achieved for declar- ative programming languages, the latter - by embedding of coordination level operators. One of the earliest such extensions, future annotation, isa proposed in [3]. Their use allows to start a function computation before the moment when computation of its annotated arguments will be completed. Another advance to increase program parallelization was using of nondeterministic operators in pseudo-functional languages [5]. One more resource widely used in logic pro- gramming to program parallelization is speculative computation of alternative branches.</description><subject>Algorithmic Skeleton</subject><subject>Applied sciences</subject><subject>Exact sciences and technology</subject><subject>Functional Language</subject><subject>Mathematics</subject><subject>Methods of scientific computing (including symbolic computation, algebraic computation)</subject><subject>Numerical analysis. Scientific computation</subject><subject>Operational research and scientific management</subject><subject>Operational research. Management science</subject><subject>Optimization. Search problems</subject><subject>Program Transformation</subject><subject>Sciences and techniques of general use</subject><subject>Semantic Declaration</subject><subject>Transition Rule</subject><issn>0302-9743</issn><issn>1611-3349</issn><isbn>9783540679561</isbn><isbn>3540679561</isbn><isbn>9783540445203</isbn><isbn>354044520X</isbn><fulltext>true</fulltext><rsrctype>book_chapter</rsrctype><creationdate>2000</creationdate><recordtype>book_chapter</recordtype><recordid>eNo9kElPwzAQhc0qotIfwC0HrqG2x-sRVWWRKoFUkLhZjmuXQJqEOJXov8ddxFxGmvfeaOZD6IbgO4KxnEDBGS4Y4xQXH4ZgOEFjLRWk6X4IpygjgpACgOmzf01IzQU5RxkGTAstGVyiTHPFiVaKX6FxjF84FVCqNc7QdPbr3WawZe3zReddFSpnh6pt8rltVhu78nlo-_zV9raufZ0vtuuyrSuXT9t1l3I76zW6CLaOfnzsI_T-MHubPhXzl8fn6f286IDQoaBaLEXAdhmoBk7lUgrmWKDMK-VLHwQNXHjvICyxEoIozZiDMp1JLbckwAjdHvZ2Njpbh942roqm66u17beGgAKiWLJNDraYlGble1O27XdMDM2OrAGTOJk9RLMnmxLsuLhvfzY-DsbvIs43Q3rbfdpu8H00gCURlKWINFIJ-AMO53Ys</recordid><startdate>2000</startdate><enddate>2000</enddate><creator>Godlevsky, Alexander B.</creator><creator>Hluchý, Ladislav</creator><general>Springer Berlin / Heidelberg</general><general>Springer Berlin Heidelberg</general><general>Springer</general><scope>FFUUA</scope><scope>IQODW</scope></search><sort><creationdate>2000</creationdate><title>Executable Specification Language for Parallel Symbolic Computation</title><author>Godlevsky, Alexander B. ; Hluchý, Ladislav</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-p312t-296d6f0adf293527d764c4f24e88ebef62f56eec3fd086618944c3b9902a5a1f3</frbrgroupid><rsrctype>book_chapters</rsrctype><prefilter>book_chapters</prefilter><language>eng</language><creationdate>2000</creationdate><topic>Algorithmic Skeleton</topic><topic>Applied sciences</topic><topic>Exact sciences and technology</topic><topic>Functional Language</topic><topic>Mathematics</topic><topic>Methods of scientific computing (including symbolic computation, algebraic computation)</topic><topic>Numerical analysis. Scientific computation</topic><topic>Operational research and scientific management</topic><topic>Operational research. Management science</topic><topic>Optimization. Search problems</topic><topic>Program Transformation</topic><topic>Sciences and techniques of general use</topic><topic>Semantic Declaration</topic><topic>Transition Rule</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Godlevsky, Alexander B.</creatorcontrib><creatorcontrib>Hluchý, Ladislav</creatorcontrib><collection>ProQuest Ebook Central - Book Chapters - Demo use only</collection><collection>Pascal-Francis</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Godlevsky, Alexander B.</au><au>Hluchý, Ladislav</au><au>Bode, Arndt</au><au>Karl, Wolfgang</au><au>Ludwig, Thomas</au><au>Wismüller, Roland</au><au>Bode, Arndt</au><au>Ludwig, Thomas</au><au>Karl, Wolfgang</au><au>Wismüller, Roland</au><format>book</format><genre>bookitem</genre><ristype>CHAP</ristype><atitle>Executable Specification Language for Parallel Symbolic Computation</atitle><btitle>Euro-Par 2000 Parallel Processing</btitle><seriestitle>Lecture Notes in Computer Science</seriestitle><date>2000</date><risdate>2000</risdate><volume>1900</volume><spage>754</spage><epage>757</epage><pages>754-757</pages><issn>0302-9743</issn><eissn>1611-3349</eissn><isbn>9783540679561</isbn><isbn>3540679561</isbn><eisbn>9783540445203</eisbn><eisbn>354044520X</eisbn><abstract>Two goals, simplicity of program designing, and efficiency of its computation, al- ways remain topical in programming, and more than anything this is true about parallel programming systems. The former goal is usually achieved for declar- ative programming languages, the latter - by embedding of coordination level operators. One of the earliest such extensions, future annotation, isa proposed in [3]. Their use allows to start a function computation before the moment when computation of its annotated arguments will be completed. Another advance to increase program parallelization was using of nondeterministic operators in pseudo-functional languages [5]. One more resource widely used in logic pro- gramming to program parallelization is speculative computation of alternative branches.</abstract><cop>Germany</cop><pub>Springer Berlin / Heidelberg</pub><doi>10.1007/3-540-44520-X_103</doi><oclcid>958519885</oclcid><tpages>4</tpages><oa>free_for_read</oa></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 0302-9743 |
| ispartof | Euro-Par 2000 Parallel Processing, 2000, Vol.1900, p.754-757 |
| issn | 0302-9743 1611-3349 |
| language | eng |
| recordid | cdi_pascalfrancis_primary_1383184 |
| source | Springer Books |
| subjects | Algorithmic Skeleton Applied sciences Exact sciences and technology Functional Language Mathematics Methods of scientific computing (including symbolic computation, algebraic computation) Numerical analysis. Scientific computation Operational research and scientific management Operational research. Management science Optimization. Search problems Program Transformation Sciences and techniques of general use Semantic Declaration Transition Rule |
| title | Executable Specification Language for Parallel Symbolic Computation |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-26T06%3A15%3A56IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_pasca&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=bookitem&rft.atitle=Executable%20Specification%20Language%20for%20Parallel%20Symbolic%20Computation&rft.btitle=Euro-Par%202000%20Parallel%20Processing&rft.au=Godlevsky,%20Alexander%20B.&rft.date=2000&rft.volume=1900&rft.spage=754&rft.epage=757&rft.pages=754-757&rft.issn=0302-9743&rft.eissn=1611-3349&rft.isbn=9783540679561&rft.isbn_list=3540679561&rft_id=info:doi/10.1007/3-540-44520-X_103&rft_dat=%3Cproquest_pasca%3EEBC3071624_107_786%3C/proquest_pasca%3E%3Curl%3E%3C/url%3E&rft.eisbn=9783540445203&rft.eisbn_list=354044520X&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=EBC3071624_107_786&rft_id=info:pmid/&rfr_iscdi=true |