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
Transparent concurrent execution of mutually exclusive alternatives
Columbia University, Department of Computer Science.
Columbia University, Department of Computer Science. (Computer Communications)ORCID iD: 0000-0002-6066-746X
1988 (English)Report (Other academic)
Abstract [en]

We examine the task of concurrently computing alternative solutions to a problem. We restrict our interest to the case where only one of the solutions is needed; in this case we need some rule for selecting between the solutions. We use "fastest first," where the first successful alternative is selected. For problems where the required execution time is unpredictable, such as database queries. this method can show substantial execution time performance increases. These increases are dependent on the mean execution time of the alternatives, the fastest execution time, and the overhead involved in concurrent computation. Among the problems with exploring multiple alternatives in parallel are side-effects and combinatorial explosion in the amount of state which must be preserved. These are solved by process management and an application of "copy-on-write" virtual memory management. The side effects resulting from interprocess communication are handled by a specialized message layer which interacts with process management. In order to test the utility of the design, we show how it can be applied to two application areas, distributed execution of recovery blocks and OR-parallelism in Prolog.

Place, publisher, year, edition, pages
New York, NY, USA: Columbia University, Department of Computer Sceince , 1988. , 11 p.
Series
Columbia University, Department of Computer Sceince, Technical Report, CUCS-387-88
National Category
Computer Science
Research subject
SRA - ICT
Identifiers
URN: urn:nbn:se:kth:diva-63050OAI: oai:DiVA.org:kth-63050DiVA: diva2:481569
Note
QC 20120227Available from: 2012-02-27 Created: 2012-01-21 Last updated: 2013-09-09Bibliographically approved

Open Access in DiVA

fulltext(773 kB)181 downloads
File information
File name FULLTEXT01.pdfFile size 773 kBChecksum SHA-512
43bfedf8be287ca8c0f7eea898e6f18e4ed16593715afb31bed3bcd60078467cb2ad631b9253368cca0a8ecb96b99e26ac069d68ab6c0fe26cadd710c8ab7379
Type fulltextMimetype application/pdf

Authority records BETA

Maguire Jr., Gerald Q.

Search in DiVA

By author/editor
Maguire Jr., Gerald Q.
Computer Science

Search outside of DiVA

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

urn-nbn

Altmetric score

urn-nbn
Total: 62 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