Newsgroups: comp.lang.prolog
Path: cantaloupe.srv.cs.cmu.edu!das-news2.harvard.edu!news2.near.net!news.mathworks.com!europa.eng.gtefsd.com!howland.reston.ans.net!spool.mu.edu!sgiblab!munnari.oz.au!cs.mu.OZ.AU!munta.cs.mu.OZ.AU!fjh
From: fjh@munta.cs.mu.OZ.AU (Fergus Henderson)
Subject: Re: ILPS 94 racquetball + improving cache behavior of logic programs
Message-ID: <9429613.13498@mulga.cs.mu.OZ.AU>
Keywords: ILPS-94, racquetball, data cache, code optimization
Sender: news@cs.mu.OZ.AU
Organization: Computer Science, University of Melbourne, Australia
References: <381eo4$dvr@optima.cs.arizona.edu> <382rea$rl0@news.tuwien.ac.at>
Date: Sun, 23 Oct 1994 03:50:00 GMT
Lines: 33

andi@mips.complang.tuwien.ac.at (Andi Krall) writes:

>debray@CS.Arizona.EDU (Saumya K. Debray) writes:
>|> (2) To justify this posting to this group: Does anyone know of any work 
>|>     on improving the (data) cache behavior of logic programs (preferably
>|>     via some kind of compile time technique)?
>
>I don't know of compilation techniques. In my knowledge for improving
>cache behaviour only generational garbage collectors are used.

One compilation technique is compile-time garbage collection.

@article { ctgc,
	author="Anne Mulkers and William Winsborough and Maurice Bruynooghe",
	title="Analysis of Shared Data Structures for Compile-Time Garbage
	       Collection in Logic Programming Languages",
	journal="Proceedings of the Seventh International Conference on
		 Logic Programming",
	year=1990,
	month=jun,
	pages="747--762",
	publisher="The MIT Press",
}

@inproceedings{ localreuse,
	author={Foster, Ian and Winsborough, Will},
	title={Copy Avoidance through Compile-Time Analysis and Local Reuse},
	pages={455--469},
	crossref={SLP91}
}

-- 
Fergus Henderson - fjh@munta.cs.mu.oz.au
