The STUDIA UNIVERSITATIS BABE┼×-BOLYAI issue article summary

The summary of the selected article appears at the bottom of the page. In order to get back to the contents of the issue this article belongs to you have to access the link from the title. In order to see all the articles of the archive which have as author/co-author one of the authors mentioned below, you have to access the link from the author's name.

 
       
         
    STUDIA INFORMATICA - Issue no. Sp.Issue 2 / 2009  
         
  Article:   EFFICIENT RECURSIVE PARALLEL PROGRAMS FOR POLYNOMIAL INTERPOLATION.

Authors:  VIRGINIA NICULESCU.
 
       
         
  Abstract:   PowerList and PowerArray theories are well suited to express recursive, data-parallel algorithms. Their abstractness is very high and assures simpleand correct design of parallel programs. This high level of abstraction could be reconciled with performance by introducing data-distributions into these theories. We present in this paper the derivation of a correct recursive program for Lagrange interpolation. The associated costs are analysed and based on this an improvement of the program is presented.

Key words and phrases. parallel computation, abstraction, design, distribution, data-structures.
 
         
     
         
         
      Back to previous page