A Paradigm of Parallel Programming for Morton-Ordered Matrices

莫顿阶矩阵并行编程范式

• 批准号: 0541364
• 负责人: David Wise
• 金额: --
• 依托单位: Indiana University
• 依托单位国家: 美国
• 项目类别: Standard Grant
• 财政年份: 2006
• 资助国家: 美国
• 起止时间: 2006-06-01 至 2009-09-30
• 项目状态: 已结题
• 来源: https://www.nsf.gov/awardsearch/showAward?AWD_ID=0541364&HistoricalAwards=false
• 关键词: Paradigm; Parallel; Programming; Morton; Ordered

BackgroundWriting portable parallel programs in high-level languages on modern computing engines is heavily constrained by locality of reference; they can only run fast if they reuse data already close to the processor, and if they can compute much more than they must communicate.Intellectual MeritThe proposed research addresses this problem with a new style of programming that organizes computationso that it is addressed implicitly. "Divide-and-conquer" applies at once to recursive control, to datasharing, to broad communication, and to machine organization. Programmers will again be able to solve important problems without much knowledge about the memory hierarchy or network communication. It will deliver high-performance computing to ordinary scientists, and allow generations of students to learn it as part of their first programming language. Success will advance computing, and all sciences and engineering that depend upon it.Broader Impacts Products include a new programming style, new efficiencies for parallel and Grid computing,tools to carry old codes into this environment, tools to support the new generation of programs,support for teaching a new generation of programmers, and new algorithms that can only be inspired by thishigh-level perspective on programming.The project offers huge payoffs, both in the future growth of useful applications of parallel computingand in delivering access to this technology to many more students and future scientists and engineers.The results of this research can simplify the teaching and learning of large-scale computing.Results will be disseminated via the usual channels of conference and journal papers, and programmingtools will be delivered over the net.

BackgroundWriting可移植的并行程序在高级语言的现代计算引擎是严重的局限性引用的地方，他们只能运行得快，如果他们重用数据已经接近处理器，如果他们可以计算远远超过他们必须communication.Intellectual MeritThe建议的研究解决了这个问题，一种新的风格的编程，组织computationso，它是隐式地解决。“分而治之”同时适用于递归控制、共享、广泛的通信和机器组织。程序员将再次能够解决重要的问题，而不需要太多关于内存层次结构或网络通信的知识。它将为普通科学家提供高性能计算，并允许一代又一代的学生将其作为第一门编程语言的一部分来学习。更广泛的影响产品包括一种新的编程风格，并行和网格计算的新效率，将旧代码携带到这个环境中的工具，支持新一代程序的工具，支持教学新一代程序员的支持，和新的算法，只能从这个高层次的编程角度来启发。这个项目提供了巨大的回报，无论是在并行计算的有用应用的未来增长，并在提供访问这一技术，以更多的学生和未来的科学家和工程师。这项研究的结果可以简化教学和学习的大型-结果将通过会议和期刊论文的通常渠道传播，编程工具将通过网络提供。