Change search
ReferencesLink to record
Permanent link

Direct link
Generating AND-parallel Execution Expressions
Number of Authors: 1
1990 (English)Report (Refereed)
Abstract [en]

An AND-parallel execution model for logic programs needs a representation of clauses that explicitly expresses the possible parallelism. It is natural to consider a clause body to be a set of indexed goals where the indices are partially ordered and the order represents the required execution model, so we need another representation which expresses the parallelism. We define an algorithm to generate balanced execution expressions for rapallel execution from the more general form with partially ordered indexed literals.

Place, publisher, year, edition, pages
Kista, Sweden: Swedish Institute of Computer Science , 1990, 1. , 13 p.
Series
SICS Research Report, ISSN 0283-3638 ; R90:07
National Category
Computer and Information Science
Identifiers
URN: urn:nbn:se:ri:diva-21345OAI: oai:DiVA.org:ri-21345DiVA: diva2:1041379
Note
Original report number R90007.Available from: 2016-10-31 Created: 2016-10-31

Open Access in DiVA

fulltext(915 kB)3 downloads
File information
File name FULLTEXT01.pdfFile size 915 kBChecksum SHA-512
c15fcc612b8ad4c4c0ee5df749a79fd6a4f58850cee0ae44fae701180a2dfd7ad400ae425a74ba5ce044fe6cc02abe9af5f40adb5950c3e69274c2992cfa18a8
Type fulltextMimetype application/pdf

Computer and Information Science

Search outside of DiVA

GoogleGoogle Scholar
Total: 3 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

ReferencesLink to record
Permanent link

Direct link