Robust Algorithmic Building Blocks for Parallel Computing

用于并行计算的强大算法构建块

基本信息

  • 批准号:
    9988304
  • 负责人:
  • 金额:
    $ 13.36万
  • 依托单位:
  • 依托单位国家:
    美国
  • 项目类别:
    Standard Grant
  • 财政年份:
    2000
  • 资助国家:
    美国
  • 起止时间:
    2000-08-01 至 2004-07-31
  • 项目状态:
    已结题

项目摘要

PROJECT SUMMARYProposal Number: NSF 9988304Robust Algorithmic Building Blocks for Parallel Computing PI: Alexander A. ShvartsmanThis research investigates algorithmic approaches to robust building blocks for parallel computing. The research direction is based on the idea that parallel solutions to computational problems can be formulated as compositions of building blocks, components that encapsulate efficient and fault-tolerant parallel implementations of well-defined computation primitives. Building blocks come equipped with precise specifications of their compositionality, and in general provide services at a higher level of abstraction than the operations made available by common parallel programming languages. A major goal of this research is to provide provably efficient building blocks that help the designers of complex parallel applications to concentrate on algorithm design while freeing them from the need to perpetually consider the problem of efficient and effective mapping of the algorithms expressed in some notation to a specific target machine. Traditionally, research in the distributed computing field has concentrated on fault-tolerance, while parallel computing research has taken speed-up as its main focus. This research synthesizes these two foci, and together with the building block methodology, it yields an approach to computing with multiple processors that obtains scalable parallel speed-up, while providing correctness and compositionality guarantees, and enabling graceful degradation in the face of failures. By combining the research on robust parallel computing with the building blocks approach to constructing complex systems, this work intends to substantially advance the state-of-the-art in the theory of effective and efficient parallel computing. Towards this end this research program deals with robust (i.e., efficient and fault-tolerant) algorithms, lower bounds that define the limits for achieving our efficiency goals, composable building blocks that encapsulate key algorithms, and program simulations and transformations that allow to efficiently execute programs specified at a high level of abstraction on the available parallel platforms.
项目概要提案号:NSF 9988304并行计算鲁棒算法构建块PI: Alexander A. shvartsman本研究探讨并行计算鲁棒构建块的算法方法。研究方向是基于这样一种思想,即计算问题的并行解决方案可以被表述为构建块的组合,组件封装了定义良好的计算原语的高效和容错并行实现。构建块配备了其组合性的精确规范,并且通常在比普通并行编程语言提供的操作更高的抽象级别上提供服务。本研究的一个主要目标是提供可证明的高效构建块,帮助复杂并行应用程序的设计人员专注于算法设计,同时将他们从需要永远考虑以某种符号表示的算法到特定目标机器的高效映射问题中解放出来。传统上,分布式计算领域的研究主要集中在容错上,而并行计算的研究主要集中在加速上。本研究综合了这两个重点,并结合构建块方法,产生了一种多处理器计算方法,该方法获得了可扩展的并行加速,同时提供了正确性和组合性保证,并在面对故障时实现了优雅的降级。通过将鲁棒并行计算的研究与构建复杂系统的构建块方法相结合,本工作旨在实质性地推进有效和高效并行计算理论的最新进展。为此,本研究项目涉及鲁棒(即高效和容错)算法,定义实现效率目标的下限,封装关键算法的可组合构建块,以及允许在可用并行平台上高效执行在高抽象级别指定的程序的程序模拟和转换。

项目成果

期刊论文数量(0)
专著数量(0)
科研奖励数量(0)
会议论文数量(0)
专利数量(0)

数据更新时间:{{ journalArticles.updateTime }}

{{ item.title }}
{{ item.translation_title }}
  • DOI:
    {{ item.doi }}
  • 发表时间:
    {{ item.publish_year }}
  • 期刊:
  • 影响因子:
    {{ item.factor }}
  • 作者:
    {{ item.authors }}
  • 通讯作者:
    {{ item.author }}

数据更新时间:{{ journalArticles.updateTime }}

{{ item.title }}
  • 作者:
    {{ item.author }}

数据更新时间:{{ monograph.updateTime }}

{{ item.title }}
  • 作者:
    {{ item.author }}

数据更新时间:{{ sciAawards.updateTime }}

{{ item.title }}
  • 作者:
    {{ item.author }}

数据更新时间:{{ conferencePapers.updateTime }}

{{ item.title }}
  • 作者:
    {{ item.author }}

数据更新时间:{{ patent.updateTime }}

Alexander Schwarzmann其他文献

Alexander Schwarzmann的其他文献

{{ item.title }}
{{ item.translation_title }}
  • DOI:
    {{ item.doi }}
  • 发表时间:
    {{ item.publish_year }}
  • 期刊:
  • 影响因子:
    {{ item.factor }}
  • 作者:
    {{ item.authors }}
  • 通讯作者:
    {{ item.author }}

{{ truncateString('Alexander Schwarzmann', 18)}}的其他基金

NSF Engines Development Award: Advancing cyber security technologies in the Central Savannah River Area (GA, SC)
NSF 引擎开发奖:推进萨凡纳河中部地区(佐治亚州、南卡罗来纳州)的网络安全技术
  • 批准号:
    2306109
  • 财政年份:
    2023
  • 资助金额:
    $ 13.36万
  • 项目类别:
    Cooperative Agreement
NSF Student Travel Grant for the 2022 International Symposium on Distributed Computing (DISC 2022)
2022 年分布式计算国际研讨会 (DISC 2022) 的 NSF 学生旅费补助金
  • 批准号:
    2237340
  • 财政年份:
    2022
  • 资助金额:
    $ 13.36万
  • 项目类别:
    Standard Grant
SaTC: CORE: Small: A Robust Framework with Rigorous Semantics and Security Guarantees for Election-Day Voter Check-in
SaTC:核心:小型:具有严格语义和安全保证的强大框架,用于选举日选民签到
  • 批准号:
    2131538
  • 财政年份:
    2021
  • 资助金额:
    $ 13.36万
  • 项目类别:
    Standard Grant
AF: Small: Collaborative Research: Principles of Robust Cooperative Computing in Dynamic Distributed Systems
AF:小型:协作研究:动态分布式系统中鲁棒协作计算的原理
  • 批准号:
    1017232
  • 财政年份:
    2010
  • 资助金额:
    $ 13.36万
  • 项目类别:
    Standard Grant
Collaborative Research: Distributed Collaborative Computing and Adversity
协作研究:分布式协作计算和逆境
  • 批准号:
    0311368
  • 财政年份:
    2003
  • 资助金额:
    $ 13.36万
  • 项目类别:
    Standard Grant
PostDoctoral Research Fellowship
博士后研究奖学金
  • 批准号:
    0209588
  • 财政年份:
    2002
  • 资助金额:
    $ 13.36万
  • 项目类别:
    Fellowship Award
Career: Principles and Practices of Dependable Distributed Computing
职业:可靠分布式计算的原理和实践
  • 批准号:
    9984778
  • 财政年份:
    2000
  • 资助金额:
    $ 13.36万
  • 项目类别:
    Continuing Grant

相似海外基金

AF: Small: Problems in Algorithmic Game Theory for Online Markets
AF:小:在线市场的算法博弈论问题
  • 批准号:
    2332922
  • 财政年份:
    2024
  • 资助金额:
    $ 13.36万
  • 项目类别:
    Standard Grant
Collaborative Research: FET: Small: Algorithmic Self-Assembly with Crisscross Slats
合作研究:FET:小型:十字交叉板条的算法自组装
  • 批准号:
    2329908
  • 财政年份:
    2024
  • 资助金额:
    $ 13.36万
  • 项目类别:
    Standard Grant
Collaborative Research: AF: Small: New Directions in Algorithmic Replicability
合作研究:AF:小:算法可复制性的新方向
  • 批准号:
    2342244
  • 财政年份:
    2024
  • 资助金额:
    $ 13.36万
  • 项目类别:
    Standard Grant
Collaborative Research: CIF: Small: Mathematical and Algorithmic Foundations of Multi-Task Learning
协作研究:CIF:小型:多任务学习的数学和算法基础
  • 批准号:
    2343599
  • 财政年份:
    2024
  • 资助金额:
    $ 13.36万
  • 项目类别:
    Standard Grant
Collaborative Research: CIF: Small: Mathematical and Algorithmic Foundations of Multi-Task Learning
协作研究:CIF:小型:多任务学习的数学和算法基础
  • 批准号:
    2343600
  • 财政年份:
    2024
  • 资助金额:
    $ 13.36万
  • 项目类别:
    Standard Grant
NSF-BSF: Collaborative Research: AF: Small: Algorithmic Performance through History Independence
NSF-BSF:协作研究:AF:小型:通过历史独立性实现算法性能
  • 批准号:
    2420942
  • 财政年份:
    2024
  • 资助金额:
    $ 13.36万
  • 项目类别:
    Standard Grant
Australian Experiences of Algorithmic Culture on TikTok
澳大利亚在 TikTok 上的算法文化体验
  • 批准号:
    DP240102939
  • 财政年份:
    2024
  • 资助金额:
    $ 13.36万
  • 项目类别:
    Discovery Projects
Algorithmic topology in low dimensions
低维算法拓扑
  • 批准号:
    EP/Y004256/1
  • 财政年份:
    2024
  • 资助金额:
    $ 13.36万
  • 项目类别:
    Fellowship
Collaborative Research: FET: Small: Algorithmic Self-Assembly with Crisscross Slats
合作研究:FET:小型:十字交叉板条的算法自组装
  • 批准号:
    2329909
  • 财政年份:
    2024
  • 资助金额:
    $ 13.36万
  • 项目类别:
    Standard Grant
Conference: ANTS XVI: Algorithmic Number Theory Symposium 2024
会议:ANTS XVI:算法数论研讨会 2024
  • 批准号:
    2401305
  • 财政年份:
    2024
  • 资助金额:
    $ 13.36万
  • 项目类别:
    Standard Grant
{{ showInfoDetail.title }}

作者:{{ showInfoDetail.author }}

知道了