Specialization-based parallel Processing without Memo-trees
| Main Authors: | Hidemi Ogasawara, Kiyoshi Akama, Hiroshi Mabuchi |
|---|---|
| Format: | Article Journal |
| Bahasa: | eng |
| Terbitan: |
, 2009
|
| Subjects: | |
| Online Access: |
https://zenodo.org/record/1072375 |
| ctrlnum |
1072375 |
|---|---|
| fullrecord |
<?xml version="1.0"?>
<dc schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd"><creator>Hidemi Ogasawara</creator><creator>Kiyoshi Akama</creator><creator>Hiroshi Mabuchi</creator><date>2009-04-28</date><description>The purpose of this paper is to propose a framework for constructing correct parallel processing programs based on Equivalent Transformation Framework (ETF). ETF regards computation as In the framework, a problem-s domain knowledge and a query are described in definite clauses, and computation is regarded as transformation of the definite clauses. Its meaning is defined by a model of the set of definite clauses, and the transformation rules generated must preserve meaning. We have proposed a parallel processing method based on “specialization", a part of operation in the transformations, which resembles substitution in logic programming. The method requires “Memo-tree", a history of specialization to maintain correctness. In this paper we proposes the new method for the specialization-base parallel processing without Memo-tree.</description><identifier>https://zenodo.org/record/1072375</identifier><identifier>10.5281/zenodo.1072375</identifier><identifier>oai:zenodo.org:1072375</identifier><language>eng</language><relation>doi:10.5281/zenodo.1072374</relation><relation>url:https://zenodo.org/communities/waset</relation><rights>info:eu-repo/semantics/openAccess</rights><rights>https://creativecommons.org/licenses/by/4.0/legalcode</rights><subject>Parallel processing</subject><subject>Program correctness</subject><subject>Equivalent transformation</subject><subject>Specializer generation rule</subject><title>Specialization-based parallel Processing without Memo-trees</title><type>Journal:Article</type><type>Journal:Article</type><recordID>1072375</recordID></dc>
|
| language |
eng |
| format |
Journal:Article Journal Journal:Journal |
| author |
Hidemi Ogasawara Kiyoshi Akama Hiroshi Mabuchi |
| title |
Specialization-based parallel Processing without Memo-trees |
| publishDate |
2009 |
| topic |
Parallel processing Program correctness Equivalent transformation Specializer generation rule |
| url |
https://zenodo.org/record/1072375 |
| contents |
The purpose of this paper is to propose a framework for constructing correct parallel processing programs based on Equivalent Transformation Framework (ETF). ETF regards computation as In the framework, a problem-s domain knowledge and a query are described in definite clauses, and computation is regarded as transformation of the definite clauses. Its meaning is defined by a model of the set of definite clauses, and the transformation rules generated must preserve meaning. We have proposed a parallel processing method based on “specialization", a part of operation in the transformations, which resembles substitution in logic programming. The method requires “Memo-tree", a history of specialization to maintain correctness. In this paper we proposes the new method for the specialization-base parallel processing without Memo-tree. |
| id |
IOS16997.1072375 |
| institution |
ZAIN Publications |
| institution_id |
7213 |
| institution_type |
library:special library |
| library |
Cognizance Journal of Multidisciplinary Studies |
| library_id |
5267 |
| collection |
Cognizance Journal of Multidisciplinary Studies |
| repository_id |
16997 |
| subject_area |
Multidisciplinary |
| city |
Stockholm |
| province |
INTERNASIONAL |
| shared_to_ipusnas_str |
1 |
| repoId |
IOS16997 |
| first_indexed |
2022-06-06T04:05:41Z |
| last_indexed |
2022-06-06T04:05:41Z |
| recordtype |
dc |
| _version_ |
1734900978716508160 |
| score |
17.538404 |