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. 1 / 2003  
         
  Article:   SCHEDULING OPTIMALITY FOR THE PARALLEL EXECUTION OF LOGIC PROGRAMS.

Authors:  MONICA VANCEA, ALEXANDRU VANCEA.
 
       
         
  Abstract:  Logic programming is the most widespread programming para- digm used in artificial intelligence, a domain which needs intensive computing resources. Parallel execution of logic programs is the most effective speedup factor which can be applied for obtaining reasonable execution time in some cases. Parallelizing compilers have the task to exploit the inherent parallelism from the sequential programs having as the ultimate goal their eficient exe- cution by means of building a time optimal schedule. These tools focus on the inherent parallelism available at the level of the logic languages operational semantics. Besides particular techniques for achieving optimal execution for specific classes of logic programs, one question arises naturally: given an arbi- trary logic program and a machine model which assumes sufficient but finite resources, is it always possible to build a time optimal schedule ? This paper defines the notion of time optimality and proves that in the general case, no time optimal schedule can be built for a logic program, because there are classes of logic programs which require infinite resources for accepting time optimal schedules.  
         
     
         
         
      Back to previous page