Mathematical Research Data Initiative
Main page
Recent changes
Random page
SPARQL
MaRDI@GitHub
New item
Special pages
In other projects
MaRDI portal item
Discussion
View source
View history
English
Log in

Termination detection in parallel loop nests with while loops

From MaRDI portal
Publication:1978397
Jump to:navigation, search

DOI10.1016/S0167-8191(99)00063-0zbMATH Open0939.68506OpenAlexW2090347009MaRDI QIDQ1978397FDOQ1978397


Authors: M. Geigl, M. Griebl, Christian Lengauer Edit this on Wikidata


Publication date: 4 June 2000

Published in: Parallel Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0167-8191(99)00063-0




Recommendations

  • An efficient parallel termination detection algorithm
  • Termination analysis of linear loop programs
  • scientific article; zbMATH DE number 618313
  • scientific article; zbMATH DE number 796664
  • Termination analysis of nonlinear loops over closed and bounded connected domain


zbMATH Keywords

code generationtermination detectionloop parallelizationwhile loopsfor loopsnon-speculative execution


Mathematics Subject Classification ID

Mathematical problems of computer architecture (68M07)



Cited In (5)

  • Forced termination of loops
  • Title not available (Why is that?)
  • Termination detection in data-driven parallel computations/applications.
  • Local Nontermination Detection for Parallel C++ Programs
  • An efficient parallel termination detection algorithm





This page was built for publication: Termination detection in parallel loop nests with while loops

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1978397)

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1978397&oldid=14430629"
Tools
What links here
Related changes
Printable version
Permanent link
Page information
This page was last edited on 1 February 2024, at 16:42. Warning: Page may not contain recent updates.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki