Highly parallel model for object-oriented concurrent constraint programming
Papadopoulos, George Angelos
SourceIEEE International Conference on Algorithms and Architectures for Parallel Processing
Proceedings of the IEEE 1st International Conference on Algorithms and Architectures for Parallel Processing. Part 1 (of 2)
Google Scholar check
MetadataShow full item record
Two of the currently most promising programming paradigms, namely Object-Oriented Programming and Concurrent Constraint Programming are combined into a single, highly parallel computational model based on Term Graph Rewriting Systems. In particular, we show how multi-headed Term Graph rewrite rules provide a powerful tool able to manipulate Term Graphs which themselves represent in a homogeneous way objects, concurrently executing agents and constraints. Due to the inherent fine grain parallelism of Term Graph Rewriting the proposed model is highly parallel with all activities (object communication, agent execution and constraint solving) executing concurrently.
Showing items related by title, author, creator and subject.
Papadopoulos, George Angelos (1998)We propose the development of multimedia programming frameworks based on the declarative logic programming setting and in particular the framework of object-oriented timed concurrent constraint programming (OO-TCCP). The ...
Papadopoulos, George Angelos (2003)This paper combines work done in the areas of Artificial Intelligence, Multimedia Systems and Coordination Programming to derive a framework for Distributed Multimedia Systems based on asynchronous timed computations ...
Papadopoulos, George Angelos (1996)The generalized computational model of Term Graph Rewriting Systems is used as the basis for expressing concurrent object-oriented programming techniques exploiting the fine grain highly parallel features of TGRS in a ...