Implementing a graph-colouring algorithm in Parlog

Authors:
M. Huntbach
Affiliations:
Department of Computing, Imperial College, London SW7, England
Venue:
ACM SIGPLAN Notices
Year:
1989

Citing 6
Cited 1

PARLOG: parallel programming in logic

ACM Transactions on Programming Languages and Systems (TOPLAS) - The MIT Press scientific computation series
Guest Editor's Introduction: Domesticating Parallelism

Computer
Concurrent Prolog: A Progress Report

Computer
Parlog86 and the dining logicians

Communications of the ACM
Register allocation and spilling via graph coloring

ACM SIGPLAN Notices - Best of PLDI 1979-1999
Virtual Tree Machines

IEEE Transactions on Computers

Agent-oriented programming: from prolog to guarded definite clauses

Agent-oriented programming: from prolog to guarded definite clauses

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we give a Parlog program for a parallel algorithm for the graph-colouring problem. Although the algorithm as originally given refers to a specific architecture, it translates with ease into Parlog. Since the parallelism in Parlog is virtual, the same program may be used on any architecture on which Parlog is implemented.