Article

Concurrent and distributed programming using constraint logic programs

Authors:

Rafael Ramirez,

Andrew SantosaAuthors Info & Claims

SAC '04: Proceedings of the 2004 ACM symposium on Applied computing

Pages 508 - 509

https://doi.org/10.1145/967900.968005

Published: 14 March 2004 Publication History

Get Access

Abstract

We describe a coordination language for high-level distributed programming. Its roots are in concurrent constraint programming where there is a shared constraint store and synchronization is achieved via constraint entailment. A system is modeled as: (a) a set of processes, and (b) a set of constraints which capture the concurrent behavior of the system. The key advantages are that (1) there is a clear separation of the concurrency and the functionality aspects of the system, (2) processes are coordinated explicitly by a declarative formalism, i.e. constraints, and (3) the processes-agents are programming language independent.

References

[1]

Broxvall, M. and Jonsson, P. 1999. Towards a complete classification of tractability in point algebras for nonlinear time. Proc. CP'99.

Digital Library

Google Scholar

[2]

Freeman, E., Hupfer, S. and Arnold, K. 1999. JavaSpaces: Principles, and Practice. Addison-Wesley.

Digital Library

Google Scholar

[3]

Kowalski, R.A. and Sergot, M.J. 1986. A logic-based calculus of events. New Generation Computing 4, pp. 67--95.

Digital Library

Google Scholar

[4]

Pratt, V. 1986. Modeling concurrency with partial orders. International Journal of Parallel Programming 15, 1, pp. 33--71.

Digital Library

Google Scholar

[5]

Ramirez, R., Santosa, A. E.2000.Concurrent programming made easy, ICECCS'00, IEEE Press.

Digital Library

Google Scholar

[6]

Ramirez, R. 1996. A logic-based concurrent object-oriented programming language, PhD thesis, Bristol University.

Google Scholar

Index Terms

Concurrent and distributed programming using constraint logic programs
1. Software and its engineering
  1. Software notations and tools
    1. General programming languages
      1. Language features
        Control structures

Recommendations

Semiring-based constraint logic programming: syntax and semantics

We extend the Constraint Logic Programming (CLP) formalism in order to handle semiring-based constraints. This allows us to perform in the same language both constraint solving and optimization. In fact, constraints based on semirings are able to model ...
Soft concurrent constraint programming

Soft constraints extend classical constraints to represent multiple consistency levels, and thus provide a way to express preferences, fuzziness, and uncertainty. While there are many soft constraint solving formalisms, even distributed ones, as yet ...
Execution privatization for scheduler-oblivious concurrent programs
OOPSLA '12

Making multithreaded execution less non-deterministic is a promising solution to address the difficulty of concurrent programming plagued by the non-deterministic thread scheduling. In fact, a vast category of concurrent programs are scheduler-oblivious:...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

SAC '04: Proceedings of the 2004 ACM symposium on Applied computing

March 2004

1733 pages

ISBN:1581138121

DOI:10.1145/967900

Conference Chair:
Hisham M. Haddad
Kennesaw State University
,
Program Chairs:
Andrea Omicini
Università degli Studi di Bologna a Cesena
,
Roger L. Wainwright
University of Tulsa
,
Publications Chair:
Lorie M. Liebrock
New Mexico Institute of Mining and Technology

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 14 March 2004

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Article

Conference

SAC04

Sponsor:

SIGAPP

SAC04: The 2004 ACM Symposium on Applied Computing

March 14 - 17, 2004

Nicosia, Cyprus

Acceptance Rates

Overall Acceptance Rate 1,650 of 6,669 submissions, 25%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

0
Total Citations
198
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 20 Nov 2024

Other Metrics

View Author Metrics

Citations

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Index Terms

Recommendations

Semiring-based constraint logic programming: syntax and semantics

Soft concurrent constraint programming

Execution privatization for scheduler-oblivious concurrent programs