Rezumat articol ediţie STUDIA UNIVERSITATIS BABE┼×-BOLYAI

În partea de jos este prezentat rezumatul articolului selectat. Pentru revenire la cuprinsul ediţiei din care face parte acest articol, se accesează linkul din titlu. Pentru vizualizarea tuturor articolelor din arhivă la care este autor/coautor unul din autorii de mai jos, se accesează linkul din numele autorului.

 
       
         
    STUDIA INFORMATICA - Ediţia nr.1 din 2003  
         
  Articol:   SCHEDULING OPTIMALITY FOR THE PARALLEL EXECUTION OF LOGIC PROGRAMS.

Autori:  MONICA VANCEA, ALEXANDRU VANCEA.
 
       
         
  Rezumat:  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.  
         
     
         
         
      Revenire la pagina precedentă