Parallelizing irregular and pointer-based computations automatically: Perspectives from logic and constraint programming
Irregular computations pose some of the most interesting and challenging problems in automatic parallelization. Irregularity appears in certain kinds of numerical problems and is pervasive in symbolic applications. Such computations often use dynamic data structures, which make heavy use of pointers...
Uložené v:
| Vydané v: | Parallel computing Ročník 26; číslo 13; s. 1685 - 1708 |
|---|---|
| Hlavný autor: | |
| Médium: | Journal Article |
| Jazyk: | English |
| Vydavateľské údaje: |
Elsevier B.V
01.12.2000
|
| Predmet: | |
| ISSN: | 0167-8191, 1872-7336 |
| On-line prístup: | Získať plný text |
| Tagy: |
Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
|
| Abstract | Irregular computations pose some of the most interesting and challenging problems in automatic parallelization. Irregularity appears in certain kinds of numerical problems and is pervasive in symbolic applications. Such computations often use dynamic data structures, which make heavy use of pointers. This complicates all the steps of a parallelizing compiler, from independence detection to task partitioning and placement. Starting in the mid 80s there has been significant progress in the development of parallelizing compilers for logic programming (and more recently, constraint programming) resulting in quite capable parallelizers. The typical applications of these paradigms frequently involve irregular computations, and make heavy use of dynamic data structures with pointers, since logical variables represent in practice a well-behaved form of pointers. This arguably makes the techniques used in these compilers potentially interesting. In this paper, we introduce in a tutorial way, some of the problems faced by parallelizing compilers for logic and constraint programs and provide pointers to some of the significant progress made in the area. In particular, this work has resulted in a series of achievements in the areas of inter-procedural pointer aliasing analysis for independence detection, cost models and cost analysis, cactus-stack memory management, techniques for managing speculative and irregular computations through task granularity control and dynamic task allocation (such as work-stealing schedulers), etc. |
|---|---|
| AbstractList | Irregular computations pose some of the most interesting and challenging problems in automatic parallelization. Irregularity appears in certain kinds of numerical problems and is pervasive in symbolic applications. Such computations often use dynamic data structures, which make heavy use of pointers. This complicates all the steps of a parallelizing compiler, from independence detection to task partitioning and placement. Starting in the mid 80s there has been significant progress in the development of parallelizing compilers for logic programming (and more recently, constraint programming) resulting in quite capable parallelizers. The typical applications of these paradigms frequently involve irregular computations, and make heavy use of dynamic data structures with pointers, since logical variables represent in practice a well-behaved form of pointers. This arguably makes the techniques used in these compilers potentially interesting. In this paper, we introduce in a tutorial way, some of the problems faced by parallelizing compilers for logic and constraint programs and provide pointers to some of the significant progress made in the area. In particular, this work has resulted in a series of achievements in the areas of inter-procedural pointer aliasing analysis for independence detection, cost models and cost analysis, cactus-stack memory management, techniques for managing speculative and irregular computations through task granularity control and dynamic task allocation (such as work-stealing schedulers), etc. |
| Author | Hermenegildo, Manuel |
| Author_xml | – sequence: 1 givenname: Manuel surname: Hermenegildo fullname: Hermenegildo, Manuel email: herme@fi.upm.es organization: School of Computer Science, Technical University of Madrid (UPM), 28660 Boadilla del Monte, Madrid, Spain |
| BookMark | eNqFkE1r3DAQhkVJoZttfkJBp5IcnEqWP5NDCEuTFAINNIXcxHg8XlRky5HsJdtfX-1uyKGXXEZzeN530HPMjgY3EGNfpDiXQhbffsVRJpWs5akQZ0KIXCZPH9hCVmWalEoVR2zxhnxixyH8iVCRVWLBXh7Ag7VkzV8zrLnxntazBc9haPnozDCRTxoI1HJ0_ThPMBk3BA7z5Pq4YwxvL_gD-TASTmZDgXfe9dy6tcF9C0Z-8hCr-Ojd2kPfx1Of2ccObKCT13fJft98f1zdJfc_b3-sru8TVKqaEpljjZg2sq1LBJFnlYQyg6YBCV3REIgyLXKETFVK5VVeiK6rM8zTqqYmqxu1ZF8PvfH280xh0r0JSNbCQG4OOi2LTMpaRTA_gOhdCJ46PXrTg99qKfTOs9571juJWgi996yfYu7yvxyag6Xdp-276atDmqKDjSGvAxoakFrjo0_dOvNOwz-umJ11 |
| CitedBy_id | crossref_primary_10_1017_S0960129521000499 crossref_primary_10_1145_504083_504085 crossref_primary_10_1016_j_tcs_2009_07_044 crossref_primary_10_1017_S1471068422000059 crossref_primary_10_1017_S1471068422000102 crossref_primary_10_1007_s11227_005_0311_2 |
| Cites_doi | 10.1016/S0167-6423(97)00007-5 10.1007/3-540-61756-6_78 10.7551/mitpress/4299.003.0014 10.1007/BFb0024759 10.1145/65979.65984 10.1145/232706.232734 10.1007/3-540-16492-8_62 10.1145/161468.161472 10.1109/IPPS.1995.395891 10.1145/512950.512973 10.1145/316686.316688 10.7551/mitpress/4298.003.0062 10.1145/154630.154636 10.1007/3-540-16492-8_63 10.1145/357162.357169 10.1145/263699.263709 10.1016/S0096-0551(96)00011-2 10.1145/321250.321253 10.1007/3-540-58601-6_95 10.1016/0167-6423(89)90014-2 10.1007/3-540-58485-4_48 10.1007/3-540-58485-4_45 10.1145/197405.197406 10.1016/0743-1066(94)90033-7 10.1016/S0096-0551(96)00010-0 10.1145/349214.349224 10.1016/0022-0000(78)90043-0 10.1016/0743-1066(94)90031-0 10.1145/93542.93564 10.1016/0743-1066(93)00007-F 10.1145/109626.109635 10.1145/185403.185453 10.7551/mitpress/4299.003.0010 10.1016/S0743-1066(96)00079-9 10.1145/135226.135233 10.1109/52.7943 10.1007/3-540-56891-3_22 10.1007/BFb0002715 10.1007/BFb0014984 10.1007/3-540-18991-2_63 10.1145/182409.182442 10.1145/263699.263703 10.1007/BF03037164 |
| ContentType | Journal Article |
| Copyright | 2000 |
| Copyright_xml | – notice: 2000 |
| DBID | AAYXX CITATION 7SC 8FD JQ2 L7M L~C L~D |
| DOI | 10.1016/S0167-8191(00)00051-X |
| DatabaseName | 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 | 1872-7336 |
| EndPage | 1708 |
| ExternalDocumentID | 10_1016_S0167_8191_00_00051_X S016781910000051X |
| GroupedDBID | --K --M -~X .DC .~1 0R~ 123 1B1 1~. 1~5 29O 4.4 457 4G. 5VS 6OB 7-5 71M 8P~ 9JN AACTN AAEDT AAEDW AAIAV AAIKJ AAKOC AALRI AAOAW AAQFI AAQXK AAXUO AAYFN ABBOA ABEFU ABFNM ABJNI ABMAC ABXDB ABYKQ ACDAQ ACGFS ACNNM ACRLP ACZNC ADBBV ADEZE ADJOM ADMUD ADTZH AEBSH AECPX AEKER AENEX AFKWA AFTJW AGHFR AGUBO AGYEJ AHHHB AHJVU AHZHX AIALX AIEXJ AIKHN AITUG AJBFU AJOXV ALMA_UNASSIGNED_HOLDINGS AMFUW AMRAJ AOUOD ASPBG AVWKF AXJTR AZFZN BJAXD BKOJK BLXMC CS3 DU5 EBS EFJIC EFLBG EJD EO8 EO9 EP2 EP3 F5P FDB FEDTE FGOYB FIRID FNPLU FYGXN G-Q G8K GBLVA GBOLZ HLZ HVGLF HZ~ H~9 IHE J1W JJJVA KOM LG9 M41 MO0 N9A O-L O9- OAUVE OZT P-8 P-9 P2P PC. Q38 R2- RIG ROL RPZ SBC SCC SDF SDG SDP SES SEW SPC SPCBC SST SSV SSZ T5K WH7 WUQ XPP ZMT ~G- 9DU AATTM AAXKI AAYWO AAYXX ABDPE ABWVN ACLOT ACRPL ACVFH ADCNI ADNMO AEIPS AEUPX AFJKZ AFPUW AGQPQ AIGII AIIUN AKBMS AKRWK AKYEP ANKPU APXCP CITATION EFKBS ~HD 7SC 8FD JQ2 L7M L~C L~D |
| ID | FETCH-LOGICAL-c338t-15c9cc2b1d97ca05481a74abba1af6bea07265ca4383358560ff94c5289eb49b3 |
| ISICitedReferencesCount | 8 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000165119600002&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 0167-8191 |
| IngestDate | Sun Sep 28 11:19:35 EDT 2025 Sat Nov 29 03:58:54 EST 2025 Tue Nov 18 21:47:36 EST 2025 Fri Feb 23 02:30:43 EST 2024 |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 13 |
| Keywords | Irregular computations Automatic parallelization Pointer aliasing analysis Abstract interpretation Cost analysis Granularity control |
| Language | English |
| License | https://www.elsevier.com/tdm/userlicense/1.0 |
| LinkModel | OpenURL |
| MergedId | FETCHMERGED-LOGICAL-c338t-15c9cc2b1d97ca05481a74abba1af6bea07265ca4383358560ff94c5289eb49b3 |
| Notes | ObjectType-Article-2 SourceType-Scholarly Journals-1 ObjectType-Feature-1 content type line 23 |
| PQID | 27641193 |
| PQPubID | 23500 |
| PageCount | 24 |
| ParticipantIDs | proquest_miscellaneous_27641193 crossref_primary_10_1016_S0167_8191_00_00051_X crossref_citationtrail_10_1016_S0167_8191_00_00051_X elsevier_sciencedirect_doi_10_1016_S0167_8191_00_00051_X |
| PublicationCentury | 2000 |
| PublicationDate | 2000-12-01 |
| PublicationDateYYYYMMDD | 2000-12-01 |
| PublicationDate_xml | – month: 12 year: 2000 text: 2000-12-01 day: 01 |
| PublicationDecade | 2000 |
| PublicationTitle | Parallel computing |
| PublicationYear | 2000 |
| Publisher | Elsevier B.V |
| Publisher_xml | – name: Elsevier B.V |
| References | T. Beaumont, D.H.D. Warren, Scheduling speculative work in or-parallel prolog systems, in: Proceedings of the 10th International Conference on Logic Programming, MIT Press, CA, June 1993, pp. 135–149 E. Tick, Compile-Time Granularity Analysis of Parallel Logic Programming Languages, in: International Conference on Fifth Generation Computer Systems. Tokyo, November 1988 Hermenegildo, Greene (BIB43) 1991; 9 D.H.D. Warren, The Extended Andorra Model with Implicit Control, Presented at ICLP'90 Workshop on Parallel Logic Programming, Eilat, Israel, June 1990 (unpublished) L. Huelsbergen, J.R. Larus, A. Aiken, Using run-time list sizes to guide parallel thread creation, in: Proceedings of the ACM Conference on Lisp and Functional Programming, June 1994 G. Almasi, A. Gottlieb (Eds.), Highly Parallel Computing, Benjamin Cummins, Menlo Park, CA, 1994 Garcı́a de la Banda, Hermenegildo, Bruynooghe, Dumortier, Janssens, Simoens (BIB34) 1996; 18 K.A.M. Ali, R. Karlsson, The muse or-parallel prolog model and its performance, in: The 1990 North American Conference on Logic Programming, MIT Press, October 1990, pp. 757–776 J.-H. Chang, A.M. Despain, D. Degroot, And-Parallelism of logic programs based on static data dependency analysis, in: Compcon Spring '85, February 1985, pp. 218–225 Sterling, Shapiro (BIB72) 1986 D.H.D. Warren, An Abstract Prolog Instruction Set, Technical Report 309, Artificial Intelligence Center, SRI International, 333 Ravenswood Ave, Menlo Park CA 94025, 1983 Bueno, Hermenegildo, Montanari, Rossi (BIB16) 1998; 30 S. Debray, M. Jain, A simple program transformation for parallelism, in: The 1994 International Symposium on Logic Programming, MIT Press, Cambridge, MA, November 1994, pp. 305–319 R. Warren, M. Hermenegildo, S.K. Debray, On the practicality of global flow analysis of logic programs, in: The Fifth International Conference and Symposium on Logic Programming, MIT Press, Cambridge, MA, August 1988, pp. 684–699 A.H. Karp, R.C. Babb, A Comparison of 12 Parallel Fortran Dialects, IEEE Software, September 1988 D.H.D. Warren, OR-Parallel Execution Models of Prolog, in: Proceedings of TAPSOFT '87, Lecture Notes in Computer Science, Springer, Berlin, March 1987 Cousot, Cousot (BIB21) 1977 S.K. Debray, P. López-Garcı́a, M. Hermenegildo, N.-W. Lin, Lower bound cost estimation for logic programs, in: The 1997 International Logic Programming Symposium, MIT Press, Cambridge, MA, October 1997, pp. 291–305 M. Hermenegildo, Relating goal scheduling, precedence, and memory management in AND-parallel execution of logic programs, in: The Fourth International Conference on Logic Programming, University of Melbourne, MIT Press, Cambridge, MA, May 1987, pp. 556–575 B. Hausman, Handling speculative work in or-parallel prolog: evaluation results, in: North American Conference on Logic Programming, Austin, TX, October 1990, pp. 721–736 J. Bevemyr, T. Lindgren, H. Millroth, Reform prolog: the language and its implementation, in: Proceedings of the 10th International Conference on Logic Programming, MIT Press, Cambridge, MA, 1993 Debray, Lin (BIB25) 1993; 15 M. Hermenegildo, An Abstract Machine for Restricted AND-parallel execution of Logic Programs, in: The Third International Conference on Logic Programming, number 225 in Lecture Notes in Computer Science, Imperial College, Springer, Berlin, July 1986, pp. 25–40 C. Braem, B. Le Charlier, S. Modart, P. Van Hentenryck, Cardinality analysis of prolog, in: Proceedings of the International Symposium on Logic Programming, MIT Press, Ithaca, NY, November 1994, pp. 457–471 Chassin, Codognet (BIB19) 1994; 26 S.K. Debray, P. López-Garcı́a, M. Hermenegildo, Non-failure analysis for logic programs, in: The 1997 International Conference on Logic Programming, MIT Press, Cambridge, MA, June 1997, pp. 48–62 M. Hermenegildo, Automatic parallelization of irregular and pointer based computations: perspectives from logic and constraint Programming, in: Proceedings of EUROPAR'97, vol. 1300 of LNCS, Springer, Berlin, August 1997, pp. 31–46 (invited) European Computer Research Center, Eclipse User's Guide, 1993 Shen (BIB69) 1996; 29 Debray, Warren (BIB29) 1989; 11 M. Hermenegildo, F. Rossi, On the correctness and efficiency of independent And-parallelism in logic programs, in: 1989 North American Conference on Logic Programming, MIT Press, Cambridge, MA, October 1989, pp. 369–390 V. Santos-Costa, D.H.D. Warren, R. Yang, Andorra-I: a parallel prolog system that transparently exploits both And- and Or-parallelism, in: Proceedings of the Third ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, ACM, April 1991, SIGPLAN Notices vol 26(7), July 1991, pp. 83–93 L.O. Andersen, Binding-time analysis and the taming of C pointers, in: Proceedings of the Symposium on Partial Evaluation and Semantics-Based Program Manipulation, ACM Press, Copenhagen, Denmark, 1993, pp. 47–58 M. Shapiro, S. Horwitz, Fast and accurate flow-insensitive points-to analysis, in: POPL'97: 24th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, ACM, Paris, France, January 1997, pages 1–14 Apt (BIB6) 1990 Marriot, Stuckey (BIB56) 1998 S.K. Debray, P. López-Garcı́a, M. Hermenegildo, N.-W. Lin, Estimating the computational cost of logic programs, in: Static Analysis Symposium, SAS'94, number 864 in LNCS, Springer, Namur, Belgium, September 1994, pp. 255–265 D. Jacobs, A. Langen, Accurate and efficient approximation of variable aliasing in logic programs, in: 1989 North American Conference on Logic Programming, MIT Press, Cambridge, MA, October 1989 K. Shen, M. Hermenegildo, Flexible scheduling for non-deterministic, And-parallel execution of logic programs, in: Proceedings of EuroPar'96, number 1124 in LNCS, Springer, Berlin, August 1996, pp. 635–640 M. Garcı́a de la Banda, M. Hermenegildo, K. Marriott, Independence in CLP Languages, ACM Trans. Program. Languages Syst. 22 (2) (2000) 269–339 P. Borgwardt, D. Rea, Distributed semi-intelligent backtracking for a stack-based and-parallel prolog, in: International Symposium on Logic Programming, IEEE Computer Society, Silver Spring, MD, 1986, pp. 211–222 E. Pontelli, G. Gupta, F. Pulvirenti, A. Ferro, Automatic compile-time parallelization of prolog programs for dependent And-parallelism, in: Proceedings of the 14th International Conference on Logic Programming, MIT Press, Cambridge, MA, July 1997, pp. 108–122 J. Chassin, J. Syre, H. Westphal, Implementation of a parallel prolog system on a commercial multiprocessor, in: Proceedings of the Ecai, August 1988, pp. 278–283 K. Muthukumar, M. Hermenegildo, Determination of variable dependence information at compile-time through abstract interpretation, in: 1989 North American Conference on Logic Programming, MIT Press, Cambridge, MA, October 1989, pp. 166–189 M. Hermenegildo, F. Rossi, Non-Strict Independent And-parallelism, in: 1990 International Conference on Logic Programming, MIT Press, Cambridge, MA, June 1990, pp. 237–252 Pontelli, Gupta, Tang, Carro, Hermenegildo (BIB64) 1996; 22 D. DeGroot, Restricted AND-parallelism, in: The International Conference on Fifth Generation Computer Systems, Tokyo, November 1984, pp. 471–478 Robinson (BIB66) 1965; 12 M. Hermenegildo, D. Cabeza, M. Carro, Using attributed variables in the implementation of concurrent and parallel logic programming systems, in: Proceedings of the 12th International Conference on Logic Programming, MIT Press, Cambridge, MA, June 1995, pp. 631–645 Hermenegildo, Rossi (BIB47) 1995; 22 M. Hermenegildo and The CLIP Group, Some methodological issues in the design of CIAO – A generic, parallel, concurrent constraint system, in: The Principles and Practice of Constraint Programming, number 874 in LNCS, Springer, Berlin, May 1994, pp. 123–133 M. Garcı́a de la Banda, F. Bueno, M. Hermenegildo, Towards independent and-parallelism in CLP, in: Programming Languages: Implementation, Logics, and Programs, number 1140 in LNCS, Springer, Aachen, Germany, September 1996, pp. 77–91 S.K. Debray, N.-W. Lin, M. Hermenegildo, Task granularity analysis in logic programs, in: Proceedings of the 1990 ACM Conference on Programming Language Design and Implementation, ACM Press, New York, June 1990, pp. 174–188 Paterson, Wegman (BIB61) 1978; 16 Van Roy (BIB74) 1994; 19/20 K. Apt, A. Shaerf, Search and Imperative Programming, in: POPL'97: 24th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, ACM Press, Paris, France, January 1997, pp. 67–79 Bacon, Graham, Sharp (BIB7) 1994; 26 D. DeGroot, A technique for compiling execution graph expressions for restricted AND-parallelism in logic programs, in: The International Supercomputing Conference, Springer, Athens, 1987, pp. 80–89 Shen, Costa, King (BIB70) 1998 Ait-Kaci (BIB1) 1991 Bueno, Garcı́a de la Banda, Hermenegildo (BIB15) 1999; 21 Pugh (BIB65) 1992; 35 A. King, K. Shen, F. Benoy, Lower-bound time-complexity analysis of logic programs, in: 1997 International Logic Programming Symposium, MIT Press, Cambridge, MA, October 1997, pp. 261–275 Best, Lengauer (BIB9) 1990; 13 S. Janson S. Haridi, Programming Paradigms of the Andorra Kernel Language, in: 1991 International Logic Programming Symposium, MIT Press, Cambridge, MA, 1991, pp. 167–183 Martelli, Montanari (BIB57) 1982; 4 Hermenegildo, Carro (BIB41) 1996; 22 López-Garcı́a, Hermenegildo, Debray (BIB54) 1996; 22 Wolfe (BIB79) 1996 Lusk (BIB55) 1990; 7 D. Cabeza, M. Hermenegildo, Extracting non-strict independent and-parallelism using sharing and freeness information, in: The 1994 International Static Analysis Symposium, number 864 in LNCS, Namur, Springer, Belgium, September 1994, pp. 297–313 Jaffar, Maher (BIB50) 1994; 19/20 K. Muthukumar, M. Hermenegildo, The CDG, UDG, and MEL methods for automatic compile-time parallelization of logic programs for independent And-parallelism, in: The International Conference on Logic Programming, MIT Press, June 1990, pp. 221–237 F. Bueno, M. Garcı́a de la Banda, M. Hermenegildo, A comparative study of methods for automatic compile-time parallelization of logic programs, in: Then Fi Pontelli (10.1016/S0167-8191(00)00051-X_BIB64) 1996; 22 10.1016/S0167-8191(00)00051-X_BIB71 Chassin (10.1016/S0167-8191(00)00051-X_BIB19) 1994; 26 10.1016/S0167-8191(00)00051-X_BIB33 10.1016/S0167-8191(00)00051-X_BIB77 10.1016/S0167-8191(00)00051-X_BIB32 10.1016/S0167-8191(00)00051-X_BIB76 10.1016/S0167-8191(00)00051-X_BIB35 10.1016/S0167-8191(00)00051-X_BIB78 Bueno (10.1016/S0167-8191(00)00051-X_BIB16) 1998; 30 10.1016/S0167-8191(00)00051-X_BIB73 10.1016/S0167-8191(00)00051-X_BIB31 10.1016/S0167-8191(00)00051-X_BIB75 10.1016/S0167-8191(00)00051-X_BIB30 10.1016/S0167-8191(00)00051-X_BIB37 10.1016/S0167-8191(00)00051-X_BIB36 10.1016/S0167-8191(00)00051-X_BIB39 10.1016/S0167-8191(00)00051-X_BIB38 10.1016/S0167-8191(00)00051-X_BIB60 10.1016/S0167-8191(00)00051-X_BIB22 Robinson (10.1016/S0167-8191(00)00051-X_BIB66) 1965; 12 Sterling (10.1016/S0167-8191(00)00051-X_BIB72) 1986 10.1016/S0167-8191(00)00051-X_BIB24 10.1016/S0167-8191(00)00051-X_BIB68 10.1016/S0167-8191(00)00051-X_BIB23 10.1016/S0167-8191(00)00051-X_BIB67 10.1016/S0167-8191(00)00051-X_BIB62 10.1016/S0167-8191(00)00051-X_BIB20 Shen (10.1016/S0167-8191(00)00051-X_BIB70) 1998 10.1016/S0167-8191(00)00051-X_BIB63 10.1016/S0167-8191(00)00051-X_BIB26 10.1016/S0167-8191(00)00051-X_BIB28 10.1016/S0167-8191(00)00051-X_BIB27 Hermenegildo (10.1016/S0167-8191(00)00051-X_BIB47) 1995; 22 Apt (10.1016/S0167-8191(00)00051-X_BIB6) 1990 Bueno (10.1016/S0167-8191(00)00051-X_BIB15) 1999; 21 Best (10.1016/S0167-8191(00)00051-X_BIB9) 1990; 13 Martelli (10.1016/S0167-8191(00)00051-X_BIB57) 1982; 4 Van Roy (10.1016/S0167-8191(00)00051-X_BIB74) 1994; 19/20 10.1016/S0167-8191(00)00051-X_BIB2 Wolfe (10.1016/S0167-8191(00)00051-X_BIB79) 1996 10.1016/S0167-8191(00)00051-X_BIB4 10.1016/S0167-8191(00)00051-X_BIB3 López-Garcı́a (10.1016/S0167-8191(00)00051-X_BIB54) 1996; 22 10.1016/S0167-8191(00)00051-X_BIB11 Debray (10.1016/S0167-8191(00)00051-X_BIB29) 1989; 11 10.1016/S0167-8191(00)00051-X_BIB10 10.1016/S0167-8191(00)00051-X_BIB13 Cousot (10.1016/S0167-8191(00)00051-X_BIB21) 1977 10.1016/S0167-8191(00)00051-X_BIB12 10.1016/S0167-8191(00)00051-X_BIB51 10.1016/S0167-8191(00)00051-X_BIB5 Lusk (10.1016/S0167-8191(00)00051-X_BIB55) 1990; 7 10.1016/S0167-8191(00)00051-X_BIB8 10.1016/S0167-8191(00)00051-X_BIB53 10.1016/S0167-8191(00)00051-X_BIB52 Bacon (10.1016/S0167-8191(00)00051-X_BIB7) 1994; 26 10.1016/S0167-8191(00)00051-X_BIB18 10.1016/S0167-8191(00)00051-X_BIB59 10.1016/S0167-8191(00)00051-X_BIB14 10.1016/S0167-8191(00)00051-X_BIB58 10.1016/S0167-8191(00)00051-X_BIB17 Paterson (10.1016/S0167-8191(00)00051-X_BIB61) 1978; 16 Shen (10.1016/S0167-8191(00)00051-X_BIB69) 1996; 29 Marriot (10.1016/S0167-8191(00)00051-X_BIB56) 1998 10.1016/S0167-8191(00)00051-X_BIB44 10.1016/S0167-8191(00)00051-X_BIB46 10.1016/S0167-8191(00)00051-X_BIB45 Ait-Kaci (10.1016/S0167-8191(00)00051-X_BIB1) 1991 Debray (10.1016/S0167-8191(00)00051-X_BIB25) 1993; 15 10.1016/S0167-8191(00)00051-X_BIB40 10.1016/S0167-8191(00)00051-X_BIB42 Pugh (10.1016/S0167-8191(00)00051-X_BIB65) 1992; 35 Jaffar (10.1016/S0167-8191(00)00051-X_BIB50) 1994; 19/20 Hermenegildo (10.1016/S0167-8191(00)00051-X_BIB41) 1996; 22 10.1016/S0167-8191(00)00051-X_BIB48 10.1016/S0167-8191(00)00051-X_BIB49 Garcı́a de la Banda (10.1016/S0167-8191(00)00051-X_BIB34) 1996; 18 Hermenegildo (10.1016/S0167-8191(00)00051-X_BIB43) 1991; 9 |
| References_xml | – reference: J. Bevemyr, T. Lindgren, H. Millroth, Exploiting recursion-parallelism in prolog, in: Proceedings of the PARLE'93, Springer, Berlin, 1993 – reference: M. Hermenegildo, F. Rossi, On the correctness and efficiency of independent And-parallelism in logic programs, in: 1989 North American Conference on Logic Programming, MIT Press, Cambridge, MA, October 1989, pp. 369–390 – reference: S.K. Debray, P. López-Garcı́a, M. Hermenegildo, Non-failure analysis for logic programs, in: The 1997 International Conference on Logic Programming, MIT Press, Cambridge, MA, June 1997, pp. 48–62 – year: 1998 ident: BIB56 publication-title: Programming with Constraints: An Introduction – reference: K. Muthukumar, M. Hermenegildo, Determination of variable dependence information at compile-time through abstract interpretation, in: 1989 North American Conference on Logic Programming, MIT Press, Cambridge, MA, October 1989, pp. 166–189 – reference: S.K. Debray, P. López-Garcı́a, M. Hermenegildo, N.-W. Lin, Estimating the computational cost of logic programs, in: Static Analysis Symposium, SAS'94, number 864 in LNCS, Springer, Namur, Belgium, September 1994, pp. 255–265 – volume: 4 start-page: 258 year: 1982 end-page: 282 ident: BIB57 article-title: An efficient unification algorithm publication-title: ACM Transactions on Programming Languages and Systems – volume: 7 year: 1990 ident: BIB55 article-title: The aurora Or-parallel prolog system publication-title: New Generation Computing – volume: 19/20 start-page: 503 year: 1994 end-page: 581 ident: BIB50 article-title: Constraint logic programming: a survey publication-title: J. Logic Program. – year: 1991 ident: BIB1 publication-title: Warren's Abstract Machine, A Tutorial Reconstruction – reference: B. Hausman, Handling speculative work in or-parallel prolog: evaluation results, in: North American Conference on Logic Programming, Austin, TX, October 1990, pp. 721–736 – reference: M. Hermenegildo, Automatic parallelization of irregular and pointer based computations: perspectives from logic and constraint Programming, in: Proceedings of EUROPAR'97, vol. 1300 of LNCS, Springer, Berlin, August 1997, pp. 31–46 (invited) – reference: D.H.D. Warren, OR-Parallel Execution Models of Prolog, in: Proceedings of TAPSOFT '87, Lecture Notes in Computer Science, Springer, Berlin, March 1987 – reference: K. Muthukumar, M. Hermenegildo, The CDG, UDG, and MEL methods for automatic compile-time parallelization of logic programs for independent And-parallelism, in: The International Conference on Logic Programming, MIT Press, June 1990, pp. 221–237 – start-page: 85 year: 1998 end-page: 99 ident: BIB70 article-title: Distance: a new metric for controlling granularity for parallel execution publication-title: Joint International Conference and Symposium on Logic Programming – start-page: 495 year: 1990 end-page: 574 ident: BIB6 article-title: Introduction to logic programming publication-title: Handbook of Theoretical Computer Science, volume B: Formal Model and Semantics – reference: European Computer Research Center, Eclipse User's Guide, 1993 – volume: 11 start-page: 451 year: 1989 end-page: 481 ident: BIB29 article-title: Functional computations in logic programs publication-title: ACM Trans. Program. Languages Syst. – reference: D.H.D. Warren, An Abstract Prolog Instruction Set, Technical Report 309, Artificial Intelligence Center, SRI International, 333 Ravenswood Ave, Menlo Park CA 94025, 1983 – reference: M. Hermenegildo, An Abstract Machine for Restricted AND-parallel execution of Logic Programs, in: The Third International Conference on Logic Programming, number 225 in Lecture Notes in Computer Science, Imperial College, Springer, Berlin, July 1986, pp. 25–40 – reference: J. Bevemyr, T. Lindgren, H. Millroth, Reform prolog: the language and its implementation, in: Proceedings of the 10th International Conference on Logic Programming, MIT Press, Cambridge, MA, 1993 – reference: M. Hermenegildo and The CLIP Group, Some methodological issues in the design of CIAO – A generic, parallel, concurrent constraint system, in: The Principles and Practice of Constraint Programming, number 874 in LNCS, Springer, Berlin, May 1994, pp. 123–133 – reference: D.H.D. Warren, The Extended Andorra Model with Implicit Control, Presented at ICLP'90 Workshop on Parallel Logic Programming, Eilat, Israel, June 1990 (unpublished) – reference: S.K. Debray, P. López-Garcı́a, M. Hermenegildo, N.-W. Lin, Lower bound cost estimation for logic programs, in: The 1997 International Logic Programming Symposium, MIT Press, Cambridge, MA, October 1997, pp. 291–305 – volume: 21 start-page: 189 year: 1999 end-page: 238 ident: BIB15 article-title: Effectiveness of abstract interpretation in automatic parallelization: a case study in logic programming publication-title: ACM Trans. Program. Languages Syst. – reference: D. DeGroot, A technique for compiling execution graph expressions for restricted AND-parallelism in logic programs, in: The International Supercomputing Conference, Springer, Athens, 1987, pp. 80–89 – reference: A. King, K. Shen, F. Benoy, Lower-bound time-complexity analysis of logic programs, in: 1997 International Logic Programming Symposium, MIT Press, Cambridge, MA, October 1997, pp. 261–275 – reference: M. Hermenegildo, F. Rossi, Non-Strict Independent And-parallelism, in: 1990 International Conference on Logic Programming, MIT Press, Cambridge, MA, June 1990, pp. 237–252 – reference: L. Huelsbergen, J.R. Larus, A. Aiken, Using run-time list sizes to guide parallel thread creation, in: Proceedings of the ACM Conference on Lisp and Functional Programming, June 1994 – reference: K.A.M. Ali, R. Karlsson, The muse or-parallel prolog model and its performance, in: The 1990 North American Conference on Logic Programming, MIT Press, October 1990, pp. 757–776 – volume: 13 start-page: 23 year: 1990 end-page: 50 ident: BIB9 article-title: Semantic independence publication-title: Science of Computer Programming – reference: F. Bueno, M. Garcı́a de la Banda, M. Hermenegildo, A comparative study of methods for automatic compile-time parallelization of logic programs, in: Then First International Symposium on Parallel Symbolic Computation, World Scientific Publishing Company, Singapore, September 1994, pp. 63–73 – reference: A.H. Karp, R.C. Babb, A Comparison of 12 Parallel Fortran Dialects, IEEE Software, September 1988 – reference: M. Shapiro, S. Horwitz, Fast and accurate flow-insensitive points-to analysis, in: POPL'97: 24th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, ACM, Paris, France, January 1997, pages 1–14 – volume: 35 start-page: 102 year: 1992 end-page: 114 ident: BIB65 article-title: A practical algorithm for exact array dependence analysis publication-title: Communications of the ACM – volume: 16 start-page: 158 year: 1978 end-page: 167 ident: BIB61 article-title: Linear unification publication-title: Journal of Computer and System Sciences – year: 1986 ident: BIB72 publication-title: The Art of Prolog – volume: 30 start-page: 51 year: 1998 end-page: 82 ident: BIB16 article-title: Partial order and contextual net semantics for atomic and locally atomic CC programs publication-title: Sci. Comput. Program. – reference: K. Shen, M. Hermenegildo, Flexible scheduling for non-deterministic, And-parallel execution of logic programs, in: Proceedings of EuroPar'96, number 1124 in LNCS, Springer, Berlin, August 1996, pp. 635–640 – reference: S. Debray, M. Jain, A simple program transformation for parallelism, in: The 1994 International Symposium on Logic Programming, MIT Press, Cambridge, MA, November 1994, pp. 305–319 – reference: M. Garcı́a de la Banda, M. Hermenegildo, K. Marriott, Independence in CLP Languages, ACM Trans. Program. Languages Syst. 22 (2) (2000) 269–339 – volume: 26 start-page: 295 year: 1994 end-page: 336 ident: BIB19 article-title: Parallel logic programming systems publication-title: Comput. Surveys – volume: 22 start-page: 115 year: 1996 end-page: 142 ident: BIB64 article-title: Improving the efficiency of nondeterministic And–parallel systems publication-title: The Computer Languages Journal – reference: J. Chassin, J. Syre, H. Westphal, Implementation of a parallel prolog system on a commercial multiprocessor, in: Proceedings of the Ecai, August 1988, pp. 278–283 – reference: D. Jacobs, A. Langen, Accurate and efficient approximation of variable aliasing in logic programs, in: 1989 North American Conference on Logic Programming, MIT Press, Cambridge, MA, October 1989 – reference: E. Tick, Compile-Time Granularity Analysis of Parallel Logic Programming Languages, in: International Conference on Fifth Generation Computer Systems. Tokyo, November 1988 – reference: R. Warren, M. Hermenegildo, S.K. Debray, On the practicality of global flow analysis of logic programs, in: The Fifth International Conference and Symposium on Logic Programming, MIT Press, Cambridge, MA, August 1988, pp. 684–699 – volume: 19/20 start-page: 385 year: 1994 end-page: 441 ident: BIB74 article-title: 1983–1993: the wonder years of sequential prolog implementation publication-title: Journal of Logic Programming – reference: K. Muthukumar, M. Hermenegildo, Combined determination of sharing and freeness of program variables through abstract interpretation, in: 1991 International Conference on Logic Programming, MIT Press, Cambridge, MA, June 1991, pp. 49–63 – reference: V. Santos-Costa, D.H.D. Warren, R. Yang, Andorra-I: a parallel prolog system that transparently exploits both And- and Or-parallelism, in: Proceedings of the Third ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, ACM, April 1991, SIGPLAN Notices vol 26(7), July 1991, pp. 83–93 – reference: D. DeGroot, Restricted AND-parallelism, in: The International Conference on Fifth Generation Computer Systems, Tokyo, November 1984, pp. 471–478 – volume: 22 start-page: 1 year: 1995 end-page: 45 ident: BIB47 article-title: Strict and non-strict independent And-parallelism in logic programs: correctness, efficiency, and compile-time conditions publication-title: J. Logic program. – reference: E. Pontelli, G. Gupta, F. Pulvirenti, A. Ferro, Automatic compile-time parallelization of prolog programs for dependent And-parallelism, in: Proceedings of the 14th International Conference on Logic Programming, MIT Press, Cambridge, MA, July 1997, pp. 108–122 – reference: S.K. Debray, N.-W. Lin, M. Hermenegildo, Task granularity analysis in logic programs, in: Proceedings of the 1990 ACM Conference on Programming Language Design and Implementation, ACM Press, New York, June 1990, pp. 174–188 – year: 1996 ident: BIB79 publication-title: High Performance Compilers for Parallel Computing – reference: L.O. Andersen, Binding-time analysis and the taming of C pointers, in: Proceedings of the Symposium on Partial Evaluation and Semantics-Based Program Manipulation, ACM Press, Copenhagen, Denmark, 1993, pp. 47–58 – volume: 12 start-page: 23 year: 1965 end-page: 41 ident: BIB66 article-title: A machine oriented logic based on the resolution principle publication-title: Journal of the ACM – reference: E. Pontelli, G. Gupta, M. Hermenegildo, &ACE: A high-performance parallel prolog system, in: International Parallel Processing Symposium, IEEE Computer Society Technical Committee on Parallel Processing, IEEE Computer Society, Silver Spring, MD, April 1995, pp. 564–572 – reference: P. Borgwardt, D. Rea, Distributed semi-intelligent backtracking for a stack-based and-parallel prolog, in: International Symposium on Logic Programming, IEEE Computer Society, Silver Spring, MD, 1986, pp. 211–222 – reference: M. Garcı́a de la Banda, F. Bueno, M. Hermenegildo, Towards independent and-parallelism in CLP, in: Programming Languages: Implementation, Logics, and Programs, number 1140 in LNCS, Springer, Aachen, Germany, September 1996, pp. 77–91 – volume: 18 start-page: 564 year: 1996 end-page: 615 ident: BIB34 article-title: Global analysis of constraint logic programs publication-title: ACM Trans. Program. Languages Syst. – reference: K. Apt, A. Shaerf, Search and Imperative Programming, in: POPL'97: 24th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, ACM Press, Paris, France, January 1997, pp. 67–79 – start-page: 238 year: 1977 end-page: 252 ident: BIB21 article-title: Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints publication-title: in: The Fourth ACM Symposium on Principles of Programming Languages – reference: G. Almasi, A. Gottlieb (Eds.), Highly Parallel Computing, Benjamin Cummins, Menlo Park, CA, 1994 – reference: M. Hermenegildo, R.I. Nasr, Efficient management of backtracking in AND-parallelism, in: The Third International Conference on Logic Programming, number 225 in LNCS, Imperial College, Springer, Berlin, July 1986, pp. 40–55 – reference: M. Hermenegildo, Relating goal scheduling, precedence, and memory management in AND-parallel execution of logic programs, in: The Fourth International Conference on Logic Programming, University of Melbourne, MIT Press, Cambridge, MA, May 1987, pp. 556–575 – volume: 22 start-page: 715 year: 1996 end-page: 734 ident: BIB54 article-title: A methodology for granularity based control of parallelism in logic programs publication-title: Journal of Symbolic Computation, Special Issue on Parallel Symbolic Computation – volume: 22 start-page: 143 year: 1996 end-page: 163 ident: BIB41 article-title: Relating data–parallelism and (And)– parallelism in logic programs publication-title: Comput. Languages J. – volume: 29 start-page: 245 year: 1996 end-page: 293 ident: BIB69 article-title: Overview of DASWAM: exploitation of dependent And-parallelism publication-title: Journal of Logic Programming – reference: T. Beaumont, D.H.D. Warren, Scheduling speculative work in or-parallel prolog systems, in: Proceedings of the 10th International Conference on Logic Programming, MIT Press, CA, June 1993, pp. 135–149 – volume: 26 start-page: 345 year: 1994 end-page: 420 ident: BIB7 article-title: Compiler transformations for high-performance computing publication-title: Computing Surveys – reference: C. Braem, B. Le Charlier, S. Modart, P. Van Hentenryck, Cardinality analysis of prolog, in: Proceedings of the International Symposium on Logic Programming, MIT Press, Ithaca, NY, November 1994, pp. 457–471 – reference: J.-H. Chang, A.M. Despain, D. Degroot, And-Parallelism of logic programs based on static data dependency analysis, in: Compcon Spring '85, February 1985, pp. 218–225 – reference: D. Cabeza, M. Hermenegildo, Extracting non-strict independent and-parallelism using sharing and freeness information, in: The 1994 International Static Analysis Symposium, number 864 in LNCS, Namur, Springer, Belgium, September 1994, pp. 297–313 – volume: 9 start-page: 233 year: 1991 end-page: 257 ident: BIB43 article-title: The &-prolog system: exploiting independent And-parallelism publication-title: New Generation Computing – reference: M. Hermenegildo, D. Cabeza, M. Carro, Using attributed variables in the implementation of concurrent and parallel logic programming systems, in: Proceedings of the 12th International Conference on Logic Programming, MIT Press, Cambridge, MA, June 1995, pp. 631–645 – volume: 15 start-page: 826 year: 1993 end-page: 875 ident: BIB25 article-title: Cost analysis of logic programs publication-title: ACM Trans. Program. Lang. Syst. – reference: S. Janson S. Haridi, Programming Paradigms of the Andorra Kernel Language, in: 1991 International Logic Programming Symposium, MIT Press, Cambridge, MA, 1991, pp. 167–183 – volume: 30 start-page: 51 year: 1998 ident: 10.1016/S0167-8191(00)00051-X_BIB16 article-title: Partial order and contextual net semantics for atomic and locally atomic CC programs publication-title: Sci. Comput. Program. doi: 10.1016/S0167-6423(97)00007-5 – ident: 10.1016/S0167-8191(00)00051-X_BIB58 – ident: 10.1016/S0167-8191(00)00051-X_BIB33 doi: 10.1007/3-540-61756-6_78 – ident: 10.1016/S0167-8191(00)00051-X_BIB63 doi: 10.7551/mitpress/4299.003.0014 – ident: 10.1016/S0167-8191(00)00051-X_BIB77 – ident: 10.1016/S0167-8191(00)00051-X_BIB12 – year: 1986 ident: 10.1016/S0167-8191(00)00051-X_BIB72 – ident: 10.1016/S0167-8191(00)00051-X_BIB73 – ident: 10.1016/S0167-8191(00)00051-X_BIB45 – ident: 10.1016/S0167-8191(00)00051-X_BIB71 doi: 10.1007/BFb0024759 – ident: 10.1016/S0167-8191(00)00051-X_BIB8 – volume: 11 start-page: 451 issue: 3 year: 1989 ident: 10.1016/S0167-8191(00)00051-X_BIB29 article-title: Functional computations in logic programs publication-title: ACM Trans. Program. Languages Syst. doi: 10.1145/65979.65984 – volume: 18 start-page: 564 issue: 5 year: 1996 ident: 10.1016/S0167-8191(00)00051-X_BIB34 article-title: Global analysis of constraint logic programs publication-title: ACM Trans. Program. Languages Syst. doi: 10.1145/232706.232734 – ident: 10.1016/S0167-8191(00)00051-X_BIB37 doi: 10.1007/3-540-16492-8_62 – ident: 10.1016/S0167-8191(00)00051-X_BIB49 – ident: 10.1016/S0167-8191(00)00051-X_BIB22 doi: 10.1007/3-540-61756-6_78 – ident: 10.1016/S0167-8191(00)00051-X_BIB60 – year: 1991 ident: 10.1016/S0167-8191(00)00051-X_BIB1 – volume: 15 start-page: 826 issue: 5 year: 1993 ident: 10.1016/S0167-8191(00)00051-X_BIB25 article-title: Cost analysis of logic programs publication-title: ACM Trans. Program. Lang. Syst. doi: 10.1145/161468.161472 – start-page: 495 year: 1990 ident: 10.1016/S0167-8191(00)00051-X_BIB6 article-title: Introduction to logic programming – ident: 10.1016/S0167-8191(00)00051-X_BIB62 doi: 10.1109/IPPS.1995.395891 – ident: 10.1016/S0167-8191(00)00051-X_BIB11 – start-page: 238 year: 1977 ident: 10.1016/S0167-8191(00)00051-X_BIB21 article-title: Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints publication-title: in: The Fourth ACM Symposium on Principles of Programming Languages doi: 10.1145/512950.512973 – ident: 10.1016/S0167-8191(00)00051-X_BIB78 – volume: 21 start-page: 189 issue: 2 year: 1999 ident: 10.1016/S0167-8191(00)00051-X_BIB15 article-title: Effectiveness of abstract interpretation in automatic parallelization: a case study in logic programming publication-title: ACM Trans. Program. Languages Syst. doi: 10.1145/316686.316688 – ident: 10.1016/S0167-8191(00)00051-X_BIB40 doi: 10.7551/mitpress/4298.003.0062 – year: 1998 ident: 10.1016/S0167-8191(00)00051-X_BIB56 – ident: 10.1016/S0167-8191(00)00051-X_BIB3 – volume: 7 issue: 2,3 year: 1990 ident: 10.1016/S0167-8191(00)00051-X_BIB55 article-title: The aurora Or-parallel prolog system publication-title: New Generation Computing – ident: 10.1016/S0167-8191(00)00051-X_BIB4 doi: 10.1145/154630.154636 – ident: 10.1016/S0167-8191(00)00051-X_BIB36 – ident: 10.1016/S0167-8191(00)00051-X_BIB44 doi: 10.1007/3-540-16492-8_63 – volume: 4 start-page: 258 issue: 3 year: 1982 ident: 10.1016/S0167-8191(00)00051-X_BIB57 article-title: An efficient unification algorithm publication-title: ACM Transactions on Programming Languages and Systems doi: 10.1145/357162.357169 – ident: 10.1016/S0167-8191(00)00051-X_BIB5 doi: 10.1145/263699.263709 – ident: 10.1016/S0167-8191(00)00051-X_BIB32 – volume: 22 start-page: 143 issue: 2/3 year: 1996 ident: 10.1016/S0167-8191(00)00051-X_BIB41 article-title: Relating data–parallelism and (And)– parallelism in logic programs publication-title: Comput. Languages J. doi: 10.1016/S0096-0551(96)00011-2 – ident: 10.1016/S0167-8191(00)00051-X_BIB53 – ident: 10.1016/S0167-8191(00)00051-X_BIB46 – start-page: 85 year: 1998 ident: 10.1016/S0167-8191(00)00051-X_BIB70 article-title: Distance: a new metric for controlling granularity for parallel execution – volume: 12 start-page: 23 issue: 23 year: 1965 ident: 10.1016/S0167-8191(00)00051-X_BIB66 article-title: A machine oriented logic based on the resolution principle publication-title: Journal of the ACM doi: 10.1145/321250.321253 – ident: 10.1016/S0167-8191(00)00051-X_BIB42 doi: 10.1007/3-540-58601-6_95 – volume: 13 start-page: 23 year: 1990 ident: 10.1016/S0167-8191(00)00051-X_BIB9 article-title: Semantic independence publication-title: Science of Computer Programming doi: 10.1016/0167-6423(89)90014-2 – ident: 10.1016/S0167-8191(00)00051-X_BIB17 doi: 10.1007/3-540-58485-4_48 – ident: 10.1016/S0167-8191(00)00051-X_BIB27 doi: 10.1007/3-540-58485-4_45 – ident: 10.1016/S0167-8191(00)00051-X_BIB2 – ident: 10.1016/S0167-8191(00)00051-X_BIB14 – volume: 26 start-page: 345 issue: 4 year: 1994 ident: 10.1016/S0167-8191(00)00051-X_BIB7 article-title: Compiler transformations for high-performance computing publication-title: Computing Surveys doi: 10.1145/197405.197406 – volume: 19/20 start-page: 503 year: 1994 ident: 10.1016/S0167-8191(00)00051-X_BIB50 article-title: Constraint logic programming: a survey publication-title: J. Logic Program. doi: 10.1016/0743-1066(94)90033-7 – volume: 22 start-page: 115 issue: 2/3 year: 1996 ident: 10.1016/S0167-8191(00)00051-X_BIB64 article-title: Improving the efficiency of nondeterministic And–parallel systems publication-title: The Computer Languages Journal doi: 10.1016/S0096-0551(96)00010-0 – ident: 10.1016/S0167-8191(00)00051-X_BIB75 – ident: 10.1016/S0167-8191(00)00051-X_BIB35 doi: 10.1145/349214.349224 – ident: 10.1016/S0167-8191(00)00051-X_BIB18 – ident: 10.1016/S0167-8191(00)00051-X_BIB20 – volume: 16 start-page: 158 issue: 2 year: 1978 ident: 10.1016/S0167-8191(00)00051-X_BIB61 article-title: Linear unification publication-title: Journal of Computer and System Sciences doi: 10.1016/0022-0000(78)90043-0 – volume: 19/20 start-page: 385 year: 1994 ident: 10.1016/S0167-8191(00)00051-X_BIB74 article-title: 1983–1993: the wonder years of sequential prolog implementation publication-title: Journal of Logic Programming doi: 10.1016/0743-1066(94)90031-0 – ident: 10.1016/S0167-8191(00)00051-X_BIB24 doi: 10.1145/93542.93564 – volume: 22 start-page: 1 issue: 1 year: 1995 ident: 10.1016/S0167-8191(00)00051-X_BIB47 article-title: Strict and non-strict independent And-parallelism in logic programs: correctness, efficiency, and compile-time conditions publication-title: J. Logic program. doi: 10.1016/0743-1066(93)00007-F – ident: 10.1016/S0167-8191(00)00051-X_BIB67 doi: 10.1145/109626.109635 – ident: 10.1016/S0167-8191(00)00051-X_BIB28 – volume: 26 start-page: 295 issue: 3 year: 1994 ident: 10.1016/S0167-8191(00)00051-X_BIB19 article-title: Parallel logic programming systems publication-title: Comput. Surveys doi: 10.1145/185403.185453 – ident: 10.1016/S0167-8191(00)00051-X_BIB26 doi: 10.7551/mitpress/4299.003.0010 – volume: 29 start-page: 245 issue: 1–3 year: 1996 ident: 10.1016/S0167-8191(00)00051-X_BIB69 article-title: Overview of DASWAM: exploitation of dependent And-parallelism publication-title: Journal of Logic Programming doi: 10.1016/S0743-1066(96)00079-9 – volume: 35 start-page: 102 issue: 8 year: 1992 ident: 10.1016/S0167-8191(00)00051-X_BIB65 article-title: A practical algorithm for exact array dependence analysis publication-title: Communications of the ACM doi: 10.1145/135226.135233 – ident: 10.1016/S0167-8191(00)00051-X_BIB59 – ident: 10.1016/S0167-8191(00)00051-X_BIB52 doi: 10.1109/52.7943 – ident: 10.1016/S0167-8191(00)00051-X_BIB10 doi: 10.1007/3-540-56891-3_22 – ident: 10.1016/S0167-8191(00)00051-X_BIB38 – ident: 10.1016/S0167-8191(00)00051-X_BIB39 doi: 10.1007/BFb0002715 – ident: 10.1016/S0167-8191(00)00051-X_BIB13 – ident: 10.1016/S0167-8191(00)00051-X_BIB30 – ident: 10.1016/S0167-8191(00)00051-X_BIB76 doi: 10.1007/BFb0014984 – ident: 10.1016/S0167-8191(00)00051-X_BIB31 doi: 10.1007/3-540-18991-2_63 – ident: 10.1016/S0167-8191(00)00051-X_BIB51 – volume: 22 start-page: 715 year: 1996 ident: 10.1016/S0167-8191(00)00051-X_BIB54 article-title: A methodology for granularity based control of parallelism in logic programs publication-title: Journal of Symbolic Computation, Special Issue on Parallel Symbolic Computation – ident: 10.1016/S0167-8191(00)00051-X_BIB48 doi: 10.1145/182409.182442 – ident: 10.1016/S0167-8191(00)00051-X_BIB68 doi: 10.1145/263699.263703 – year: 1996 ident: 10.1016/S0167-8191(00)00051-X_BIB79 – volume: 9 start-page: 233 issue: 3,4 year: 1991 ident: 10.1016/S0167-8191(00)00051-X_BIB43 article-title: The &-prolog system: exploiting independent And-parallelism publication-title: New Generation Computing doi: 10.1007/BF03037164 – ident: 10.1016/S0167-8191(00)00051-X_BIB23 |
| SSID | ssj0006480 |
| Score | 1.6150827 |
| Snippet | Irregular computations pose some of the most interesting and challenging problems in automatic parallelization. Irregularity appears in certain kinds of... |
| SourceID | proquest crossref elsevier |
| SourceType | Aggregation Database Enrichment Source Index Database Publisher |
| StartPage | 1685 |
| SubjectTerms | Abstract interpretation Automatic parallelization Cost analysis Granularity control Irregular computations Pointer aliasing analysis |
| Title | Parallelizing irregular and pointer-based computations automatically: Perspectives from logic and constraint programming |
| URI | https://dx.doi.org/10.1016/S0167-8191(00)00051-X https://www.proquest.com/docview/27641193 |
| Volume | 26 |
| WOSCitedRecordID | wos000165119600002&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: 1872-7336 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0006480 issn: 0167-8191 databaseCode: AIEXJ dateStart: 19950101 isFulltext: true titleUrlDefault: https://www.sciencedirect.com providerName: Elsevier |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV1Lb9QwELaWLQculKcoFPCBAxwCeThx3NuqKgKEqkoUKbfIdhK0aJusskm1gj_P-JVkW6ECEpdolcR2tPNlHs58Mwi9EoVfFKJUH1kF8UDhcY8zQjxOIVgIk7hKpa4z-5menqZZxs5ms5-OC3O5onWdbrds_V9FDedA2Io6-xfiHiaFE_AbhA5HEDsc_0jwZ7xV_VFWyx-artK2utu8SZVcN6o8ROsp26XpbOu-s7lwvO8aXb6Vq-bT0ULnxlsa5sawULSatEQ4VXiWw2QuwevCmcDvu09hF3FX9a5rewEK9ttyVTSGLVT3Nm_f7T5czeS4Tosxu5SgfVUkaIyM0awpBVc-MtVOnOo1ZHkHsWiiSIPEdPKxRjmguvrDdYVv9h6-DCuCW666W-tWqIGXjVZuyD3U96pbdXwUB9kttBfSmKVztLf4eJJ9Ggx5QnTjvWHukQD2blzwte-_sYv9zrW5YuS153J-D921IQdeGKjcR7OyfoD2XTsPbLX7Q7TdQQ4ekINB4ngHOXiKHLyDnCM8xQ1WuMEaN3qWETd4gptH6Ov7k_PjD55tzOHJKEo7L4glkzIUQcGo5OD0pwGnhAvBA14louQ-hddcclUGN4J4NPGrihEZQ3BfCsJE9BjN66YunyBMfVZV4NNSVhUkVTPFtKAlrSIZ8lKEB4i4_zSXtmq9es5VPklPTGiuRJH7qtQtiCLPDtDbYdjalG25aUDqBJZb39P4lDkg7aahL52Ac9DN6oMbr8um3-QhTUgAEdLTf5_8GbozvnaHaN61ffkc3ZaX3XLTvrCI_QV3U7Ux |
| 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=Parallelizing+irregular+and+pointer-based+computations+automatically%3A+Perspectives+from+logic+and+constraint+programming&rft.jtitle=Parallel+computing&rft.au=Hermenegildo%2C+Manuel&rft.date=2000-12-01&rft.pub=Elsevier+B.V&rft.issn=0167-8191&rft.eissn=1872-7336&rft.volume=26&rft.issue=13&rft.spage=1685&rft.epage=1708&rft_id=info:doi/10.1016%2FS0167-8191%2800%2900051-X&rft.externalDocID=S016781910000051X |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0167-8191&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0167-8191&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0167-8191&client=summon |