Research on the Automatic Implementation of High Level Programming Constructs

该项目涉及算法的设计， 并行计算机系统的程序设计环境， 大量互连的处理器。 目标是发展 这种系统的用户使用的一些通用算法技术 将需要，以确定什么样的原始操作应该是 包括在高级并行编程语言中，并解决 在实现过程中会出现的一些算法问题 如此原始的操作。 特别关注的业务 涉及面向集合的数据结构和组合搜索。 的 有效执行这些行动的方法是 从随机负载平衡、并行树搜索和动态 树嵌入 为了支持高级并行编程， 在存在故障处理器的情况下进行排序的有效算法， 还研究了消息路由和同步控制。

This project is concerned with the design of algorithms and programming environments for parallel computer systems containing large numbers of interconnected processors. The goals are to develop some of the generic algorithmic techniques that users of such systems will require, to determine what primitive operations should be included in a high-level parallel programming language, and to solve some of the algorithmic problems that will arise in the implementation of such primitive operations. The operations of particular interest relate to set-oriented data structures and combinatorial search. The approach to the efficient implementation of these operations uses ideas from randomized load balancing, parallel tree search and dynamic tree embedding. In order to support high-level parallel programming, efficient algorithms for sorting in the presence of faulty processors, message routing and synchronization control are also investigated.