The Chare-Kernel Base Language: Preliminary Performance Results
暂无分享,去创建一个
[1] Laxmikant V. Kalé,et al. Supporting Machine Independent Programming on Diverse Parallel Architectures , 1991, ICPP.
[2] L. V. KaleDepartment. Tolerating Latency with Dagger , .
[3] Laxmikant V. Kalé,et al. The mesh superceded? , 1989, CSC '89.
[4] Laxmikant V. Kalé,et al. A specialized expert system for judicial decision support , 1989, ICAIL '89.
[5] Laxmikant V. Kalé,et al. The Chare Kernel Parallel Programming Language and System , 1990, ICPP.
[6] Laxmikant V. Kalé,et al. Joining AND Parallel Solutions in AND/OR Parallel Systems , 1990, NACLP.
[7] Laxmikant V. Kale,et al. Parallel problem solving , 1990 .
[8] Laxmikant V. Kalé,et al. Compiled Execution of the Reduce-OR Process Model on Multiprocessors , 1989, NACLP.
[9] Bailey. Proceedings of the 1988 international conference on parallel processing , 1988 .
[10] Schwetman. Proceedings of the 1991 international conference on parallel processing , 1991 .
[11] Laxmikant V. Kalé,et al. Chare Kernel - a Runtime Support System for Parallel Computations , 1991, J. Parallel Distributed Comput..
[12] Laxmikant V. Kalé,et al. A Chare kernel implementation of a parallel Prolog compiler , 1990, PPOPP '90.
[13] Laxmikant V. Kalé,et al. Implementation of a parallel Prolog interpreter on multiprocessors , 1991, [1991] Proceedings. The Fifth International Parallel Processing Symposium.
[14] L. V. Kale,et al. Obtaining first solution faster in parallel problem solving , 1988 .
[15] Laxmikant V. Kalé,et al. High level support for divide-and-conquer parallelism , 1991, Proceedings of the 1991 ACM/IEEE Conference on Supercomputing (Supercomputing '91).
[16] Laxmikant V. Kalé,et al. 'Completeness' and 'Full Parallelism' of Parallel Logic Programming Schemes , 1987, SLP.
[17] Laxmikant V. Kalé,et al. Comparing the Performance of Two Dynamic Load Distribution Methods , 1988, ICPP.
[18] Laxmikant V. Kale,et al. Efficient Parallel Execution of IDA on Shared and Distributed Memory Multiprocessors , 1991, The Sixth Distributed Memory Computing Conference, 1991. Proceedings.
[19] Laxmikant V. Kalé,et al. Consistent Linear Speedups to a First Solution in Parallel State-Space Search , 1990, AAAI.
[20] Laxmikant V. Kalé,et al. The Reduce-Or Process Model for Parallel Execution of Logic Programs , 1991, J. Log. Program..
[21] Laxmikant V. Kalé,et al. Prolog at the University of Illinois , 1988, Digest of Papers. COMPCON Spring 88 Thirty-Third IEEE Computer Society International Conference.
[22] Laxmikant V. Kalé,et al. An Almost Perfect Heuristic for the N Nonattacking Queens Problem , 1990, Inf. Process. Lett..
[23] L.V. Kale,et al. D-trees: a class of dense regular interconnection topologies , 1988, Proceedings., 2nd Symposium on the Frontiers of Massively Parallel Computation.
[24] Laxmikant V. Kalé,et al. A Tree Representation for Parallel Problem Solving , 1988, AAAI.
[25] L.V. Kale. A brief perspective on parallel programming , 1989, Fourth IEEE Region 10 International Conference TENCON.
[26] Laxmikant V. Kalé,et al. A Memory Organization Independent Binding Environment for AND and OR Parallel Execution of Logic Programs , 1988, ICLP/SLP.
[27] Laxmikant V. Kalé,et al. Optimal Communication Neighborhoods , 1986, ICPP.
[28] Laxmikant V. Kalé,et al. An Abstract Machine for the Reduce-OR Process Model for Parallel Prolog , 1989, KBCS.
[29] Laxmikant V. Kalé,et al. Executing Distributed Prolog Programs on a Broadcast Network , 1984, International Conference on Spoken Language Processing.