The Optimization of Goal Scheduling on KLIC

Bibliographic Information

Other Title
  • KLICにおけるゴール・スケジューリング最適化

Search this article

Abstract

In the conventional run-time system for the parallel logic programming language KLl, its fine-grained concurrency control frequently casues unnecessary goal switching which degrades its execution performance. We propose an optimization method to reduce the number of goal switching. In this method, we analyse the data dependency among goals to find a group of goals, named thread. A thread consists of the goals which are executed in a predefined order and are free from deadlock caused by mutual data dependency. Thus this threading reduces not only the number of goal switching but also the overhead on the switching owing to the static scheduling. On the dynamic scheduling of threads, we give a priority to each thread so that a generator thread of a request data is scheduled prior to other threads. Evaluation results show that we achieved 1.7 fold speedup by this optimization.

Journal

  • IPSJ SIG Notes

    IPSJ SIG Notes 96 (107), 43-48, 1996-10-31

    Information Processing Society of Japan (IPSJ)

Details 詳細情報について

  • CRID
    1573950401960917632
  • NII Article ID
    110002929559
  • NII Book ID
    AN10485570
  • Text Lang
    ja
  • Data Source
    • CiNii Articles

Report a problem

Back to top