A parallelization of the constraint logic programming language 2LP.
Item
-
Title
-
A parallelization of the constraint logic programming language 2LP.
-
Identifier
-
AAI9224791
-
identifier
-
9224791
-
Creator
-
Atay, Coskun.
-
Contributor
-
Adviser: Kenneth McAloon
-
Date
-
1992
-
Language
-
English
-
Publisher
-
City University of New York.
-
Subject
-
Computer Science | Operations Research
-
Abstract
-
2LP is a modeling and control language for applications in Operations Research and Artificial Intelligence developed at the Logic Based Systems Laboratory at Brooklyn College of CUNY. It is a small, compact language with C-like syntax that has been designed to run on various parallel architectures and it is the first parallel implementation of a Constraint Logic Programming (CLP) language. Its engine is based on the revised simplex method coupled with logic programming techniques. The parallel implementation preserves the sequential semantics for a very large class of programs and is especially effective in dealing with mixed integer optimization and combinatorial problems.;In order to achieve greater scalability and portability, we employ an OR-parallel model of logic programming based on recomputation using an itinerary which leads a processor to a point in the computation tree. This model makes the 2LP system portable across parallel platforms of different kinds. We have developed and tested different work distribution strategies which take advantage of the itinerary technique of distributing work in a parallel environment. Currently versions are running on a network of Sun workstations using C-Linda (tuple space model), the Intel iPSC Hypercube (message passing model), and the BBN Butterfly (shared memory model). On all three architectures, the parallel code provides significant improvement in performance over the sequential code, and the sequential code itself outperforms commercial codes on some examples.
-
Type
-
dissertation
-
Source
-
PQT Legacy CUNY.xlsx
-
degree
-
Ph.D.
