Combinatorial Topology and Concurrent Computation

从组合拓扑学和代数拓扑学中引出的概念和技术已经成功地解决了并发和分布式计算中常见的一些基本问题。本研究主要围绕两个目标展开。首先，要进一步探索和利用并发计算和拓扑学之间的新兴联系，还需要做很多工作。特别是，需要将代数和组合拓扑学中的经典概念重新表述为更适合建模计算要求的术语。其次，有很多机会将基于拓扑的技术应用于新出现的模型和问题，改进和扩展先前的结果。在不久的将来，几乎所有的计算机，从超级计算机到烟雾探测器，都将是共享内存的多处理器(通常称为多核)。因此，了解如何利用这种新发现的并发性是现代计算机科学的中心问题之一。该奖项由EPSCoR共同资助

Concepts and techniques drawn from combinatorial and algebraic topology have been successful at solving a number of fundamental problems common to concurrent and distributed computing. This research focuses on two goals. First, much needs to be done to further explore and exploit the emerging connection between concurrent computing and topology. In particular, there is a need to reformulate classical notions from algebraic and combinatorial topology in terms better-suited to the demands of modeling computation. Second, there are many opportunities to apply techniques based on topology to emerging models and problems, refining and extending earlier results.In the near future, nearly all computers, from supercomputers to smoke detectors, will be shared-memory multiprocessors (often called multicores). As a result, understanding how to exploit this new-found concurrency is one of the central issues in modern Computer Science.This award is co-funded by EPSCoR