Home | Quick Search | Advanced Search | Bibliography submission | Bibliography submission using bibtex | Bibliography submission using bibtex file | Links | Help | Internal

Details:

   
TitleGröbner Bases Computation in Strand: A Case Study for Concurrent Symbolic Computation in Logic Programming Languages
Author(s) Kurt Siegl
TypeMaster's Theses
AbstractThis thesis studies the adequacy of parallel logic programming
languages for the purpose of parallel symbolic computation. We conclude that the languages of the guarded Horn clause type are best suited for parallel Symbolic Computation. Various programming examples show that the usage of logic languages is a major step forward in parallel programming.
In a case study we describe a novel approach to the parallelization
of Buchberger's Gröbner bases algorithm using a medium grain pipe-line principle for the polynomial reduction. The approach is implemented in STRAND88 on a 17 transputer distributed memory system and shows a remarkable speed-up.
Length118
File
LanguageEnglish
Year1990
MonthNovember
Edition0
Translation No
Refereed No
Organization Johannes Kepler University Linz
Webmaster