Hashing in Massively Parallel Computation

大规模并行计算中的哈希

• 批准号: 9408445
• 负责人: James Abello
• 金额: $ 3.18万
• 依托单位: Texas A&M Engineering Experiment Station
• 依托单位国家: 美国
• 项目类别: Standard Grant
• 财政年份: 1994
• 资助国家: 美国
• 起止时间: 1994-09-15 至 1995-08-31
• 项目状态: 已结题
• 来源: https://www.nsf.gov/awardsearch/showAward?AWD_ID=9408445&HistoricalAwards=false
• 关键词: Hashing; Massively; Parallel; Computation

9408445 Abello The problem of supporting interprocessor communication in massively parallel computers raises two competing issues. To avoid bottlenecks in memory access, it may be necessary to perform hashing; i.e., to randomize the mapping of memory addresses to their physical locations. On the other hand, it is usually more efficient to access long contiguous blocks of memory than a random set of individual memory locations, and therefore it is desirable to preserve the physical locality of memory addresses. The study of the tradeoffs between these issues has only recently been initiated. However, several mathematical techniques have emerged as possible approaches for the extension of this research. This research plans to exploit these techniques to develop a robust theory of locality and randomness with applications to the complexity theory of parallel computation. ***

9408445 Abello在大规模并行计算机中支持处理器间通信的问题提出了两个相互竞争的问题。 为了避免存储器访问中的瓶颈，可能需要执行散列;即，以随机化存储器地址到其物理位置的映射。 另一方面，访问长的连续存储器块通常比访问随机的一组单独的存储器位置更有效，因此希望保持存储器地址的物理局部性。 对这些问题之间的权衡的研究只是最近才开始的。 然而，一些数学技术已经出现了可能的方法，为这项研究的扩展。 本研究计划利用这些技术来开发一个强大的局部性和随机性理论与应用程序的并行计算的复杂性理论。 ***