Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Performance evaluation of a storage model for OR-parallel execution of logic programs
RISE - Research Institutes of Sweden, ICT, SICS.
RISE - Research Institutes of Sweden, ICT, SICS.
1986 (English)Report (Other academic)
Abstract [en]

As the next step towards a computer architecture for parallel execution of logic programs we have implemented four refinements of the basic storage model for OR-Parallelism and gathered data about their performance on two types of shared memory architectures, with and without local memories. The results show how the different properties of the implementations influence performance, and indicate that the implementations using hashing techniques (hash windows) will perform best, especially on systems with a global storage and caches. We rise the question of the usefulness of the simulation technique as a tool in developing new computer architectures. Our answer is that simulations can not give the ultimate answers to the design questions, but if only the judiciosly chosen parts of the machine are simulated on a detailed level, then the obtained results can give a very good guidance in making design choice.

Place, publisher, year, edition, pages
Kista, Sweden: Swedish Institute of Computer Science , 1986, 1. , 24 p.
Series
SICS Research Report, ISSN 0283-3638 ; R86:03
National Category
Computer and Information Science
Identifiers
URN: urn:nbn:se:ri:diva-22226OAI: oai:DiVA.org:ri-22226DiVA: diva2:1041771
Note

Also located in the Proceedings of the 1986 Symposium on Logic Programming, September 22-25, 1986, Salt Lake City, Utah. pp. 246-257. IEEE Computer Society Press. Original report number R86003.

Available from: 2016-10-31 Created: 2016-10-31 Last updated: 2017-10-12Bibliographically approved

Open Access in DiVA

fulltext(2659 kB)11 downloads
File information
File name FULLTEXT01.pdfFile size 2659 kBChecksum SHA-512
db1c0b8ef16419f3c07d117827f2540de32d5b64eac51189c834e77a487f0239980fb5711b0e63520f414f14128ed02272597be714605496ba77954dfe3bdb66
Type fulltextMimetype application/pdf

By organisation
SICS
Computer and Information Science

Search outside of DiVA

GoogleGoogle Scholar
Total: 11 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

Total: 5 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
v. 2.28.0