Algorithms for Distributed, Fault-Tolerant and Secure, Computing and for Routing and Control in Parallel Computers

信息分散算法(IDA)的研究使得在分布式并行系统中存储和路由信息成为可能，从而获得高度容错和时空高效的性能。将开发这种方法的应用，特别是在异步并行计算机中的布线和在磁盘阵列中存储信息。现在存在非加密的、安全的(即秘密的和抵抗恶意攻击者的)分布式计算协议。将这些方法应用于将ITOSS(操作系统安全集成工具包)扩展到分布式系统环境中，从而实现基于分布式授权的系统安全。IDA通过对数据进行计算，改进了数据的路由。这意味着对计算和数据交换之间可能的权衡进行了研究。随机化算法将继续是研究上述问题的主要工具。

The work on the Information Dispersal Algorithm (IDA) makes it possible to store and route information in distributed and parallel systems so as to achieve highly fault tolerant and space-time efficient performance. Applications of this method will be developed, in particular to routing in asynchronous parallel computers and to storage of information in disk arrays. There now exist, non-cryptographic, secure (i.e. secret and resistant to malicious adversaries) distributed computing protocols. These methods will be applied to extend the ITOSS (Integrated Toolkit for Operating System Security) to the distributed system environment so as to achieve system security based on distributed authority. IDA brings about an improvement in routing of data through computation on that data. This suggests a study of the possible tradeoffs between computation and switching of data. Randomized algorithms will continue to be a major tool in the study of the above questions.