咨询与建议

限定检索结果

文献类型

  • 23 篇 期刊文献
  • 20 篇 会议

馆藏范围

  • 43 篇 电子文献
  • 0 种 纸本馆藏

日期分布

学科分类号

  • 39 篇 工学
    • 35 篇 计算机科学与技术...
    • 17 篇 软件工程
    • 9 篇 电气工程
    • 2 篇 信息与通信工程
  • 14 篇 理学
    • 11 篇 数学
    • 2 篇 天文学
    • 2 篇 统计学(可授理学、...
    • 1 篇 物理学
  • 1 篇 管理学
    • 1 篇 管理科学与工程(可...

主题

  • 43 篇 massively parall...
  • 7 篇 ccs concepts
  • 4 篇 parallel algorit...
  • 4 篇 gpu
  • 3 篇 mapreduce
  • 3 篇 computational mo...
  • 3 篇 scientific visua...
  • 3 篇 parallel computi...
  • 3 篇 computing method...
  • 3 篇 domain decomposi...
  • 2 篇 query processing
  • 2 篇 scalability
  • 2 篇 variational ineq...
  • 2 篇 connectivity
  • 2 篇 computer graphic...
  • 2 篇 mpc
  • 2 篇 center dot compu...
  • 2 篇 rendering
  • 2 篇 distributed algo...
  • 2 篇 center dot theor...

机构

  • 2 篇 univ s florida t...
  • 2 篇 graz univ techno...
  • 2 篇 max planck inst ...
  • 2 篇 vsb tech univ os...
  • 1 篇 univ cote azur i...
  • 1 篇 hsch medien d-70...
  • 1 篇 univ copenhagen ...
  • 1 篇 duke univ durham...
  • 1 篇 univ pittsburgh ...
  • 1 篇 univ warwick dep...
  • 1 篇 univ of bergen b...
  • 1 篇 univ turin comp ...
  • 1 篇 univ s florida c...
  • 1 篇 king abdullah un...
  • 1 篇 czech tech univ ...
  • 1 篇 tech univ denmar...
  • 1 篇 arizona state un...
  • 1 篇 sandia natl labs...
  • 1 篇 univ penn wharto...
  • 1 篇 no arizona univ ...

作者

  • 2 篇 horak david
  • 2 篇 keller alexander
  • 2 篇 coy sam
  • 2 篇 czumaj artur
  • 2 篇 guthe michael
  • 2 篇 moreland kenneth
  • 2 篇 kruzik jakub
  • 2 篇 binder nikolaus
  • 2 篇 dostal zdenek
  • 1 篇 yuan yongke
  • 1 篇 jain aryamaan
  • 1 篇 bittner jiri
  • 1 篇 plateauhollevill...
  • 1 篇 lucas l.
  • 1 篇 peterka tom
  • 1 篇 chajdas matthaeu...
  • 1 篇 brzobohaty tomas
  • 1 篇 papka michael e.
  • 1 篇 gain james
  • 1 篇 nagel wolfgang e...

语言

  • 43 篇 英文
检索条件"主题词=massively parallel algorithms"
43 条 记 录,以下是31-40 订阅
排序:
Scalable adaptive algorithms for next-generation multiphase flow simulations  37
Scalable adaptive algorithms for next-generation multiphase ...
收藏 引用
37th IEEE International parallel and Distributed Processing Symposium (IPDPS)
作者: Saurabh, Kumar Ishii, Masado Khanwale, Makrand A. Sundar, Hari Ganapathysubramanian, Baskar Iowa State Univ Dept Mech Engn Ames IA 50011 USA Univ Utah Sch Comp Salt Lake City UT USA Stanford Univ Ctr Turbulence Res Stanford CA USA
High-fidelity flow simulations are indispensable when analyzing systems exhibiting multiphase flow phenomena. The accuracy of multiphase flow simulations is strongly contingent upon the finest mesh resolution used to ... 详细信息
来源: 评论
parallel Approximation of the Maximum Likelihood Estimation for the Prediction of Large-Scale Geostatistics Simulations
Parallel Approximation of the Maximum Likelihood Estimation ...
收藏 引用
IEEE International Conference on Cluster Computing (CLUSTER)
作者: Abdulah, Sameh Ltaief, Hatem Sun, Ying Genton, Marc G. Keyes, David E. King Abdullah Univ Sci Technol Extreme Comp Res Ctr Comp Comp Elect & Math Sci & Engn Div Thuwal Saudi Arabia
Maximum likelihood estimation is an important statistical technique for estimating missing data, for example in climate and environmental applications, which are usually large and feature data points that are irregula... 详细信息
来源: 评论
GPU-based Image Compression for Efficient Compositing in Distributed Rendering Applications  11
GPU-based Image Compression for Efficient Compositing in Dis...
收藏 引用
IEEE 11th Symposium on Large Data Analysis and Visualization (LDAV)
作者: Lipinksi, Riley Moreland, Kenneth Papka, Michael E. Marrinan, Thomas Univ St Thomas St Paul MN 55105 USA Oak Ridge Natl Lab Oak Ridge TN USA Argonne Natl Lab Argonne IL 60439 USA Northern Illinois Univ De Kalb IL 60115 USA
Visualizations of large-scale data sets are often created on graphics clusters that distribute the rendering task amongst many processes. When using real-time GPU-based graphics algorithms, the most time-consuming asp... 详细信息
来源: 评论
GPU algorithms for Fastest Path Problem in Temporal Graphs  24
GPU Algorithms for Fastest Path Problem in Temporal Graphs
收藏 引用
53rd International Conference on parallel Processing (ICPP)
作者: Srikanth, Mithinti Singh, Prashant Ramakrishna, G. Indian Inst Technol Tirupati Tirupati Andhra Pradesh India
This paper introduces the first GPU-based parallel algorithms to solve the fastest path duration (FPD) problem in temporal graphs. Fastest path duration in temporal graphs is a well studied problem that has multiple u... 详细信息
来源: 评论
faimGraph: High Performance Management of Fully-Dynamic Graphs Under Tight Memory Constraints on the GPU
faimGraph: High Performance Management of Fully-Dynamic Grap...
收藏 引用
International Conference on High Performance Computing, Networking, Storage, and Analysis (SC)
作者: Winter, Martin Mlakar, Daniel Zayer, Rhaleb Seidel, Hans-Peter Steinberger, Markus Graz Univ Technol Graz Austria Max Planck Inst Informat Saarbrucken Germany
In this paper, we present a fully-dynamic graph data structure for the Graphics Processing Unit (GPU). It delivers high update rates while keeping a low memory footprint using autonomous memory management directly on ... 详细信息
来源: 评论
Comparing Binary-Swap algorithms for Odd Factors of Processes  8
Comparing Binary-Swap Algorithms for Odd Factors of Processe...
收藏 引用
8th IEEE Symposium on Large-Scale Data Analysis and Visualization (LDAV)
作者: Moreland, Kenneth Sandia Natl Labs Livermore CA 94550 USA
A key component of most large-scale rendering systems is a parallel image compositing algorithm, and the most commonly used compositing algorithms are binary swap and its variants. Although shown to be very efficient,... 详细信息
来源: 评论
A Visual Model for Quality Driven Refinement of Global Illumination  17
A Visual Model for Quality Driven Refinement of Global Illum...
收藏 引用
ACM Symposium on Applied Perception (SAP)
作者: Guenther, Robert Guthe, Stefan Guthe, Michael Bayreuth Univ Univ Str 30 D-95440 Bayreuth Germany Tech Univ Darmstadt Rundeturmstr 12 D-64283 Darmstadt Germany
When rendering complex scenes using path-tracing methods, long processing times are required to calculate a sufficient number of samples for high quality results. In this paper, we propose a new method for priority sa... 详细信息
来源: 评论
A Deterministic Algorithm for the MST Problem in Constant Rounds of Congested Clique  2021
A Deterministic Algorithm for the MST Problem in Constant Ro...
收藏 引用
53rd Annual ACM SIGACT Symposium on Theory of Computing (STOC)
作者: Nowicki, Krzysztof Univ Copenhagen Copenhagen Denmark Univ Wroclaw Wroclaw Poland
In this paper we show that the Minimum Spanning Tree problem (MST) can be solved deterministically in O(1) rounds of the Congested Clique model. In the Congested Clique model there are n players that perform computati... 详细信息
来源: 评论
FastFlow: GPU Acceleration of Flow and Depression Routing for Landscape Simulation
收藏 引用
COMPUTER GRAPHICS FORUM 2024年 第7期43卷
作者: Jain, Aryamaan Kerbl, Bernhard Gain, James Finley, Brandon Cordonnier, Guillaume Univ Cote Azur Inria Nice France TU Wien Vienna Austria Univ Cape Town Cape Town South Africa Univ Lausanne Lausanne Switzerland
Terrain analysis plays an important role in computer graphics, hydrology and geomorphology. In particular, analyzing the path of material flow over a terrain with consideration of local depressions is a precursor to m... 详细信息
来源: 评论
GPU-enabled searches for periodic signals of unknown shape
收藏 引用
ASTRONOMY AND COMPUTING 2022年 38卷 100511-100511页
作者: Gowanlock, M. Butler, N. R. Trilling, D. E. McNeill, A. No Arizona Univ Sch Informat Comp & Cyber Syst Flagstaff AZ 86011 USA Arizona State Univ Sch Earth & Space Explorat Tempe AZ 85287 USA No Arizona Univ Dept Astron & Planetary Sci Flagstaff AZ 86011 USA
Recent and future generation observatories will enable the study of variable astronomical phenomena through their time-domain capabilities. High temporal fidelity will allow for unprecedented investigations into the n... 详细信息
来源: 评论