🚀 go-pugleaf

In article <1992Apr5.175911.22506@dcs.qmw.ac.uk>
	mmh@cs.qmw.ac.uk (Matthew Huntbach) writes:

> Clearly it would be impossible for any language to be
> completely parallel in your sense. Since you cannot have an
> infinite number of processors, you will always be able to find
> a problem where the number of branches in the search tree
> needing to be searched exceeds the number of processors.
> 
> Unfortunately, Parlog and the other concurrent logic
> programming languages don't specify what to do when this
> situation is reached. Depth-first, breadth-first or anything in
> between as the default would fit into the languages'
> specification. The case you mention above is simply how one
> particular implementor of Parlog has chosen to resolve the
> problem.
> 
> I have addressed this problem and suggested a solution which
> gives the user more control in a paper recently published,
> "Speculative Computation and Priorities in Concurrent Logic
> Languages" by Matthew Huntbach.
> In proceeedings of 3rd UK Annual Conference on Logiv
> Programming, published by Springer-Verlag, editors
> G.A.Wiggins, C.Mellish. T.Duncan.

To solve the problem, we also introduced the notion of priority in the
design of a language called KL1, which is based on GHC.  The following
articles briefly describe the feature.

@inproceedings{PIMOS,
	author={Takashi Chikayama and Hiroyuki Sato and Toshihiko Miyazaki},
	title={Overview of the Parallel Inference Machine Operating 
		System ({P}{I}{M}{O}{S})},
	booktitle={Proceedings of FGCS'88},
	institution={ICOT},
	address={Tokyo, Japan},
	pages={230--251},
	year=1988}

@article{KL-Design,
	author={Kazunori Ueda and Takashi Chikayama},
	title={Design of the Kernel Language for the Parallel
		Inference Machine},
	journal={The Computer Journal},
	month={December},
	year={1990}}

Many computation mapping techniques are developed based upon this
mechanism and actually tried out on physically parallel machines.  One
of them is reported in the following.

@inproceedings{Multi-Level-Balancer,
	author={Masakazu Furuichi, Kazuo Taki, and Nobuyuki Ichiyoshi},
	title={A Multi-Level Load Balancing Scheme for OR-Parallel
		Exhaustive Search Programs on the Multi-{P}{S}{I}},
	booktitle={Proceedings of the Second ACM SIGPLAN Symposium on
		Principles and Practice of Parallel Programming},
	pages={50--59},
	year={1990},	
	month={March}}

Takashi Chikayama
Institute for New Generation Computer Technology