1

G. Varghese , T. Lauck, Hashed and hierarchical timing wheels: data structures for the efficient implementation of a timer facility, ACM SIGOPS Operating Systems Review, v.21 n.5, p.25-38, Nov. 1987

1

Douglas W. Jones, An empirical comparison of priority-queue and event-set implementations, Communications of the ACM, v.29 n.4, p.300-311, April 1986  [doi>10.1145/5684.5686]

1

Nicholas Carriero , David Gelernter, Linda in context, Communications of the ACM, v.32 n.4, p.444-458, April 1989  [doi>10.1145/63334.63337]

2

Miller, M.S., Bobrow, D.C., Tribhle, E.D.. and Levy, J. Logical secrets. In Proceedings 4th International Conference. MIT Press. 1987. pp. 704- 728. Also Chapter 24 in {7}.

3

S. Naqvi , S. Tsur, A logical language for data and knowledge bases, Computer Science Press, Inc., New York, NY, 1989

4

G. A. Ringwood, Parlog86 and the dining logicians, Communications of the ACM, v.31 n.1, p.10-25, Jan. 1988  [doi>10.1145/35043.35044]

5

Vijay A. Saraswat, Partial correctness semantics for CP [ , | , &], Proceedings of the Fifth Conference on Foundations of Software Technology and Theoretical Computer Science, p.347-368, December 16-18, 1985

6

Ehud Shapiro, The family of concurrent logic programming languages, ACM Computing Surveys (CSUR), v.21 n.3, p.413-510, Sep. 1989  [doi>10.1145/72551.72555]

7

E. Shapiro, Concurrent prolog: collected papers, MIT Press, Cambridge, MA, 1987

8

E. Shapiro, Systolic programming: a paradigm of parallel processing, Concurrent Prolog, MIT Press, Cambridge, MA, 1988

9

E. Shapiro, A subset of Concurrent Prolog and its interpreter, Concurrent Prolog, MIT Press, Cambridge, MA, 1988

10

W. Silverman , M. Hirsch , A. Houri , E. Shapiro, The Logix system user manual version 1.21, Concurrent Prolog: collected papers, MIT Press, Cambridge, MA, 1988

11

Stephen Taylor, Parallel logic programming techniques, Prentice-Hall, Inc., Upper Saddle River, NJ, 1989

12

Stephen Taylor , Shmuel Safra , Ehud Shapiro, A parallel implementation of flat concurrent prolog, International Journal of Parallel Programming, v.15 n.3, p.245-275, June 1986  [doi>10.1007/BF01414556]

13

Stephen Taylor , Lisa Hellerstein , Shmuel Safra , Ehud Shapiro, Notes on the complexity of systolic programs, Journal of Parallel and Distributed Computing, v.4 n.3, p.250-265, June 1, 1987  [doi>10.1016/0743-7315(87)90036-0]

14

Kazunori Ueda, Guarded Horn Clauses, Proceedings of the 4th Conference on Logic Programming '85, p.168-179, July 01-03, 1985

1

Braner, M. Brenda--A Tool for Parallel Programming. Cornell Theory Center. Ithaca, N.Y., 1989.

2

Braner, M. Trollius User's Reference Manual. Cornell Theory Center, It haca, N.Y., 1988.

3

Nicholas Carriero , David Gelernter, Linda in context, Communications of the ACM, v.32 n.4, p.444-458, April 1989  [doi>10.1145/63334.63337]

4

Fox, G., eta}., Soh,illg Problems on Co,current Proc~'ss~rs, Vol. I. Prentic:e-Hall, Englewood Cliffs, N.J. }988.

5

Inmos I,td. occam(i~' 2 Reference Manual. Prentice-Hall, Cambridge,

6

CORPORATE INMOS Limited, Transputer development system (2nd ed.), Prentice-Hall, Inc., Upper Saddle River, NJ, 1990

7

ParaSofi (:orp. Multitasking: Rum~in(~ Multiple Processes ureter Express. Mission Viejo, Calif., } g88.

8

ParaSofi Corp. ~.vpr~'ss Docz~metltatio!!. Missioa Viejo, Calif'.. }988.

9

Perihelion Software. HelitJs T~'chnic,~l Manu,~l. Shepton Mallet, United Kingdom, 1988.

10

3I, I,td. Tra,sputer Pascal Documentatio,. 3I, l,td., Edinburgh, United Kingdom, 1987.

11

Welch, P.H. Occam and transputer engineering class notes. Univ. of Kent, Canterbury, 1989.

1

William C. Athas , Charles L. Seitz, Multicomputers: Message-Passing Concurrent Computers, Computer, v.21 n.8, p.9-24, August 1988  [doi>10.1109/2.73]

2

Nicholas Carriero , David Gelernter, Linda in context, Communications of the ACM, v.32 n.4, p.444-458, April 1989  [doi>10.1145/63334.63337]

3

William J. Dally, A VLSI Architecture for Concurrent Data Structures, Kluwer Academic Publishers, Norwell, MA, 1987

4

Richard P. Gabriel , John McCarthy, Queue-based multi-processing LISP, Proceedings of the 1984 ACM Symposium on LISP and functional programming, p.25-44, August 06-08, 1984, Austin, Texas, United States  [doi>10.1145/800055.802019]

5

Robert H Halstead, Jr., Parallel symbolic computing, Computer, v.19 n.8, p.35-43, Aug. 1986  [doi>10.1109/MC.1986.1663306]

6

Kale. L.V. Parallel execution of l.ogic Programs: The REDUCE_OR process model. In Proceedings of the 4th International Confi'rence on Logic Programming (Parkville, Victoria. Australia, May 25-29). Univ. of Melbourne, 1987, pp. 616-632.

7

Kale, I,.V., and Shu. W. Tile Chare Kernel language for parallel programming: A perspective. UIUCr)CS-R-88-1451, Dept. of Computer Science, Univ. of lt{inois, 1988.

8

Ramkumar, B., and Kale, L.V. Compiled execution of the Reduce-Or process model on multiprocessors. UILJ(:D(}S-R-89-1513. Dept. of Computer Science. IJniv. of Illinois. 1989.

1

Kahn. K.. and Miller, M.S. Language Design and Open Systems. In Tire Ecology of Ct.nputation. North Holland, 1988.

2

Kornfeld, W. Ether--A parallel problem solving system. In I}CAI-79. August, 1979.

3

M. S. Miller , D. G. Bobrow , E. D. Tribble , J. Levy, Logical secrets, Concurrent Prolog: collected papers, MIT Press, Cambridge, MA, 1988

1

Bjornson, R., et al. The implementation and perk~rmance of hypercube l.,inda. RR-690, Dept. Computer Science. Yale University, March 1989.

2

(;arriero. N.. and (;elernter, D. (;oordination languages and their significance, lies. Rep. Dept. Computer Science, Yale University. I une 1 ,qS,q.

3

Paolo Ciancarini, Blackboard programming in shared Prolog, Selected papers of the second workshop on Languages and compilers for parallel computing, p.170-185, May 1990, Urbana, Illinois, United States

Robert Rönngren , Rassul Ayani, A comparative study of parallel and sequential priority queue algorithms, ACM Transactions on Modeling and Computer Simulation (TOMACS), v.7 n.2, p.157-209, April 1997

David Gelernter , Nicholas Carriero, Coordination languages and their significance, Communications of the ACM, v.35 n.2, p.97-107, Feb. 1992