Demand transformation analysis for concurrent constraint programs

This paper presents a demand transformation analysis that maps a predicate's output demands to its input demands. This backward dataflow analysis for concurrent constraint programs is constructed in the framework of abstract interpretation. In the context of stream parallelism, this analysis id...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:The journal of logic programming Jg. 42; H. 3; S. 185 - 215
Hauptverfasser: Falaschi, Moreno, Hicks, Patrick, Winsborough, William
Format: Journal Article
Sprache:Englisch
Veröffentlicht: Elsevier Inc 2000
ISSN:0743-1066, 1873-5789
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Abstract This paper presents a demand transformation analysis that maps a predicate's output demands to its input demands. This backward dataflow analysis for concurrent constraint programs is constructed in the framework of abstract interpretation. In the context of stream parallelism, this analysis identifies an amount of input data for which predicate execution can safely wait without danger of introducing deadlock. We assume that programs are well-moded and prove that our analysis is safe. We have constructed an implementation of this analysis and tested it on some small, illustrative programs and have determined that it gives useful results in practice. We identify several applications of the analysis results to distributed implementations of concurrent constraint languages, including thread construction and communication granularity control. This analysis will enable existing computational cost estimation analyses to be applied to stream-parallel logic languages.
AbstractList This paper presents a demand transformation analysis that maps a predicate's output demands to its input demands. This backward dataflow analysis for concurrent constraint programs is constructed in the framework of abstract interpretation. In the context of stream parallelism, this analysis identifies an amount of input data for which predicate execution can safely wait without danger of introducing deadlock. We assume that programs are well-moded and prove that our analysis is safe. We have constructed an implementation of this analysis and tested it on some small, illustrative programs and have determined that it gives useful results in practice. We identify several applications of the analysis results to distributed implementations of concurrent constraint languages, including thread construction and communication granularity control. This analysis will enable existing computational cost estimation analyses to be applied to stream-parallel logic languages.
Author Winsborough, William
Hicks, Patrick
Falaschi, Moreno
Author_xml – sequence: 1
  givenname: Moreno
  surname: Falaschi
  fullname: Falaschi, Moreno
  organization: Dipartimento di Matematica e Informatica, Via delle Scienze 206, Udine, Italy
– sequence: 2
  givenname: Patrick
  surname: Hicks
  fullname: Hicks, Patrick
  organization: Department of Computer Science and Engineering, Pennsylvania State University, University Park, Pittsburgh, PA 16802, USA
– sequence: 3
  givenname: William
  surname: Winsborough
  fullname: Winsborough, William
  organization: Transarc Corporation, Gulf Tower, 707 Grant Street, Pittsburgh, PA 15219, USA
BookMark eNqFkE1LxDAQhoMouLv6E4SeRA_VfDRNigdZ1k9Y8KCeQ5pOJdIma9IV9t-b7ooHL5tLhuF5J5lnig6dd4DQGcFXBJPy-hWLguUEl-VFVV3idIpcHKAJkYLlXMjqEE3-kGM0jfEzMYQQPkHzO-i1a7IhaBdbH3o9WO8y7XS3iTZmqZUZ78w6BHDDWMaE2lSugv8Iuo8n6KjVXYTT33uG3h_u3xZP-fLl8XkxX-aGMTnkmgKlhREtGC5rUVdtw4hhdQml0AxjXZUGNNMSc84lq5mUjBe1aGhBcUE1m6Hz3dz08Nca4qB6Gw10nXbg11FRQXkphEjgzQ40wccYoFXGDtu1xp93imA1alNbbWp0oqpKbbWpMc3_pVfB9jps9uZudzlIDr4tBBWNBWegsQHMoBpv90z4ASj_h5A
CitedBy_id crossref_primary_10_1017_S1471068406002882
ContentType Journal Article
Copyright 2000 Elsevier Science Inc.
Copyright_xml – notice: 2000 Elsevier Science Inc.
DBID 6I.
AAFTH
AAYXX
CITATION
7SC
8FD
JQ2
L7M
L~C
L~D
DOI 10.1016/S0743-1066(99)00004-7
DatabaseName ScienceDirect Open Access Titles
Elsevier:ScienceDirect:Open Access
CrossRef
Computer and Information Systems Abstracts
Technology Research Database
ProQuest Computer Science Collection
Advanced Technologies Database with Aerospace
Computer and Information Systems Abstracts – Academic
Computer and Information Systems Abstracts Professional
DatabaseTitle CrossRef
Computer and Information Systems Abstracts
Technology Research Database
Computer and Information Systems Abstracts – Academic
Advanced Technologies Database with Aerospace
ProQuest Computer Science Collection
Computer and Information Systems Abstracts Professional
DatabaseTitleList Computer and Information Systems Abstracts
DeliveryMethod fulltext_linktorsrc
Discipline Computer Science
EISSN 1873-5789
EndPage 215
ExternalDocumentID 10_1016_S0743_1066_99_00004_7
S0743106699000047
GroupedDBID --K
--M
-~X
.~1
0R~
0SF
123
1B1
1RT
1~.
1~5
29K
4.4
4G.
5VS
6I.
7-5
71M
8P~
AACTN
AAEDT
AAEDW
AAFTH
AAIKJ
AAKOC
AALRI
AAOAW
AAQFI
AAQXK
AAXUO
AAYFN
ABBOA
ABEFU
ABMAC
ABVKL
ABXDB
ABYKQ
ACDAQ
ACGFS
ACNCT
ACNNM
ACRLP
ADBBV
ADEZE
ADMUD
AEKER
AETEA
AEXQZ
AFFNX
AFKWA
AFTJW
AGHFR
AGUBO
AGYEJ
AHHHB
AIEXJ
AIKHN
AITUG
AJBFU
AJOXV
ALMA_UNASSIGNED_HOLDINGS
AMFUW
AMRAJ
ASPBG
AVWKF
AXJTR
AZFZN
BKOJK
BLXMC
CS3
D-I
D0L
EBS
EFJIC
EJD
EO8
EO9
EP2
EP3
FDB
FEDTE
FGOYB
FIRID
FNPLU
FYGXN
G-2
G-Q
G8K
GBOLZ
HVGLF
HZ~
IHE
IXB
KOM
KQ8
LG9
M26
M41
MO0
NCXOZ
O-L
O9-
OAUVE
OK1
OZT
P-9
PC.
Q38
R2-
ROL
RPZ
SDF
SDG
SEW
SPC
SSV
SSZ
T5K
TN5
UHS
WUQ
XJT
9DU
AATTM
AAXKI
AAYWO
AAYXX
ABDPE
ABJNI
ABWVN
ACLOT
ACRPL
ACVFH
ADCNI
ADNMO
ADVLN
AEIPS
AEUPX
AFPUW
AGQPQ
AIGII
AIIUN
AKBMS
AKRWK
AKYEP
ANKPU
CITATION
EFKBS
~HD
7SC
8FD
JQ2
L7M
L~C
L~D
ID FETCH-LOGICAL-c338t-a2e224c7fec58b7b9fd31c3b6e67a300a96cea3a8055583b388354b7d242042a3
ISICitedReferencesCount 4
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000084635900002&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN 0743-1066
IngestDate Sun Nov 09 14:31:57 EST 2025
Sat Nov 29 06:24:12 EST 2025
Tue Nov 18 20:41:03 EST 2025
Fri Feb 23 02:34:25 EST 2024
IsDoiOpenAccess true
IsOpenAccess true
IsPeerReviewed false
IsScholarly false
Issue 3
Language English
License http://www.elsevier.com/open-access/userlicense/1.0
https://www.elsevier.com/tdm/userlicense/1.0
https://www.elsevier.com/open-access/userlicense/1.0
LinkModel OpenURL
MergedId FETCHMERGED-LOGICAL-c338t-a2e224c7fec58b7b9fd31c3b6e67a300a96cea3a8055583b388354b7d242042a3
Notes ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 23
OpenAccessLink https://dx.doi.org/10.1016/S0743-1066(99)00004-7
PQID 27256777
PQPubID 23500
PageCount 31
ParticipantIDs proquest_miscellaneous_27256777
crossref_citationtrail_10_1016_S0743_1066_99_00004_7
crossref_primary_10_1016_S0743_1066_99_00004_7
elsevier_sciencedirect_doi_10_1016_S0743_1066_99_00004_7
PublicationCentury 2000
PublicationDate 2000-00-00
PublicationDateYYYYMMDD 2000-01-01
PublicationDate_xml – year: 2000
  text: 2000-00-00
PublicationDecade 2000
PublicationTitle The journal of logic programming
PublicationYear 2000
Publisher Elsevier Inc
Publisher_xml – name: Elsevier Inc
SSID ssj0001115
Score 1.2868885
Snippet This paper presents a demand transformation analysis that maps a predicate's output demands to its input demands. This backward dataflow analysis for...
SourceID proquest
crossref
elsevier
SourceType Aggregation Database
Enrichment Source
Index Database
Publisher
StartPage 185
Title Demand transformation analysis for concurrent constraint programs
URI https://dx.doi.org/10.1016/S0743-1066(99)00004-7
https://www.proquest.com/docview/27256777
Volume 42
WOSCitedRecordID wos000084635900002&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
journalDatabaseRights – providerCode: PRVESC
  databaseName: Elsevier SD Freedom Collection Journals 2021
  customDbUrl:
  eissn: 1873-5789
  dateEnd: 20001231
  omitProxy: false
  ssIdentifier: ssj0001115
  issn: 0743-1066
  databaseCode: AIEXJ
  dateStart: 19950101
  isFulltext: true
  titleUrlDefault: https://www.sciencedirect.com
  providerName: Elsevier
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV1LT9wwELZg6YELr1JBKeADSHAIzcZJbB9XBQQ9oEqAujfLcbzSCsgisiB-fsevJFDxOnCJVtF6ZGU-zXwzHs8gtCOVyuKkhOgE2EBkCG_EMjqKYk0049KcHRV22AQ9O2PDIf_js0q1HSdAq4o9PvLbT1U1vANlm6uzH1B3IxRewG9QOjxB7fB8l-IP9Y2tiuwwUltx7JuPmLJCiIGV78ukDD80YyKmoVSr7vJVg6JOcwlrKMMfb4LXs70cgYUrOyAYzARInrQ5bXXVGQbQXAz6O65qwJ8ZEmTr_Fze50kSIu5YKdvjNHajU4JJTZMOdEjHPvbdfB7vahN3k_M_K-4SCueN6F0TFe4m3AY0EW1dVziuf-bRmjrDtoQNRAkjSnAurBhBZ9FcQiGe6qG5wenR8HfjwMH8Z033VljTXvz62e5pj_N9v5-XKM0z524Zy8USWvChBh44iCyjGV2toMUwxgN7q_4VDRxi8FPE4IAYDK9wixjcIgYHxKyiy-Oji18nkZ-sESlC2DSSiQbqpuhIq4wVtOCjkvQVKXKdU0niWPJcaUkks-3gSEGYyQ8WtARCB1Zekm-oV00qvYZwrpmhnQxE6lRxAvFASmWflSnLdamzdZSGjyOUbztvNnktXlXOOjpolt26vitvLWDhywtPHh0pFICqt5ZuB00JMK7mxExWenJfi4RCREAp_f7R3WygedezweTqfqDe9O5eb6Iv6mE6ru-2POD-AaPBl4E
linkProvider Elsevier
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Demand+transformation+analysis+for+concurrent+constraint+programs&rft.jtitle=The+journal+of+logic+programming&rft.au=Falaschi%2C+Moreno&rft.au=Hicks%2C+Patrick&rft.au=Winsborough%2C+William&rft.date=2000&rft.issn=0743-1066&rft.volume=42&rft.issue=3&rft.spage=185&rft.epage=215&rft_id=info:doi/10.1016%2FS0743-1066%2899%2900004-7&rft.externalDBID=n%2Fa&rft.externalDocID=10_1016_S0743_1066_99_00004_7
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0743-1066&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0743-1066&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0743-1066&client=summon