A novel algorithm and its hardware support for the run-time detection of and-parallelism

Marsh, A

dc.contributor.author	Marsh, A	en
dc.date.accessioned	2014-03-01T01:47:04Z
dc.date.available	2014-03-01T01:47:04Z
dc.date.issued	1998	en
dc.identifier.issn	01296264	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/25138
dc.relation.uri	http://www.scopus.com/inward/record.url?eid=2-s2.0-0032260870&partnerID=40&md5=ed84290ee7c540d94b4c7136881024c7	en
dc.subject.other	Computer hardware	en
dc.subject.other	Computer systems programming	en
dc.subject.other	Data communication systems	en
dc.subject.other	Parallel algorithms	en
dc.subject.other	Program compilers	en
dc.subject.other	Query languages	en
dc.subject.other	Response time (computer systems)	en
dc.subject.other	Algorithms	en
dc.subject.other	Database systems	en
dc.subject.other	Information analysis	en
dc.subject.other	Optimization	en
dc.subject.other	Problem solving	en
dc.subject.other	Sideways information passing (sip)	en
dc.subject.other	And-parallelism	en
dc.subject.other	Hardware support	en
dc.subject.other	Run-time detection	en
dc.subject.other	Search space	en
dc.subject.other	Parallel processing systems	en
dc.subject.other	Parallel algorithms	en
dc.title	A novel algorithm and its hardware support for the run-time detection of and-parallelism	en
heal.type	journalArticle	en
heal.publicationDate	1998	en
heal.abstract	It is well established in query evaluation literature that pushing constants (i.e. bound variable values) through selections, enables the problem specific information to be used effectively and is essential for constraining a query's search space. This amounts to a decision on how information gained about bindings in some body atom in a clause is to be used in evaluating other atoms in the clause. This binding passing algorithm is referred to in deductive database literature as a 'sideways information passing strategy' (sip). A sip that is determined at compile-time for uncovered definite clauses can only devise the most general sip and therefore may be suboptimal at run-time. A sip determined at run-time is however inefficient - overheads outweigh advantages. To overcome these dilemmas a dynamic sip has been devised that uses a hybrid compile-time analysis, based on abstract interpretation, combined with a run-time verification. The pragmatics of the run-time verification is presented in this paper along with its novel hardware support providing a uniform performance of 155ns independent of the number of body atoms to detect an initial processing order for the independent atoms. © World Scientific Publishing Company.	en
heal.journalName	Parallel Processing Letters	en
dc.identifier.volume	8	en
dc.identifier.issue	4	en
dc.identifier.spage	489	en
dc.identifier.epage	501	en