Zobrazeno 1 - 10
of 59
pro vyhledávání: '"Lethin, Richard"'
Autor:
Ros-Giralt, Jordi, Amsel, Noah, Yellamraju, Sruthi, Ezick, James, Lethin, Richard, Jiang, Yuang, Feng, Aosong, Tassiulas, Leandros
The conventional view of the congestion control problem in data networks is based on the principle that a flow's performance is uniquely determined by the state of its bottleneck link, regardless of the topological properties of the network. However,
Externí odkaz:
http://arxiv.org/abs/2210.03534
As the sheer amount of computer generated data continues to grow exponentially, new bottlenecks are unveiled that require rethinking our traditional software and hardware architectures. In this paper we present five algorithms and data structures (lo
Externí odkaz:
http://arxiv.org/abs/1711.06754
Autor:
Ros-Giralt, Jordi, Commike, Alan, Cullen, Peter, Lucovsky, Jeff, Madathil, Dilip, Lethin, Richard
Priority queues are container data structures essential to many high performance computing (HPC) applications. In this paper, we introduce multiresolution priority queues, a data structure that improves the performance of the standard heap based impl
Externí odkaz:
http://arxiv.org/abs/1705.09642
Autor:
Gopalakrishnan, Ganesh, Hovland, Paul D., Iancu, Costin, Krishnamoorthy, Sriram, Laguna, Ignacio, Lethin, Richard A., Sen, Koushik, Siegel, Stephen F., Solar-Lezama, Armando
Maintaining leadership in HPC requires the ability to support simulations at large scales and fidelity. In this study, we detail one of the most significant productivity challenges in achieving this goal, namely the increasing proclivity to bugs, esp
Externí odkaz:
http://arxiv.org/abs/1705.07478
We present a sparse multidimensional FFT (sMFFT) randomized algorithm for real positive vectors. The algorithm works in any fixed dimension, requires (O(R log(R) log(N)) ) samples and runs in O( R log^2(R) log(N)) complexity (where N is the total siz
Externí odkaz:
http://arxiv.org/abs/1604.06682
As illustrated by the emergence of a class of new languages and runtimes, it is expected that a large portion of the programs to run on extreme scale computers will need to be written as graphs of event-driven tasks (EDTs). EDT runtime systems, which
Externí odkaz:
http://arxiv.org/abs/1601.05458
Autor:
Vasilache, Nicolas, Baskaran, Muthu, Henretty, Tom, Meister, Benoit, Langston, M. Harper, Tavarageri, Sanket, Lethin, Richard
This contribution discusses the automatic generation of event-driven, tuple-space based programs for task-oriented execution models from a sequential C specification. We developed a hierarchical mapping solution using auto-parallelizing compiler tech
Externí odkaz:
http://arxiv.org/abs/1409.1914
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1997.
Includes bibliographical references (p. 251-260).
by Richard Anton Lethin.
Ph.D.
Includes bibliographical references (p. 251-260).
by Richard Anton Lethin.
Ph.D.
Externí odkaz:
http://hdl.handle.net/1721.1/43397
Publikováno v:
In Future Generation Computer Systems September 2018 86:535-545
As part of the MACH-B (Multipole Accelerator Codes for Hadron Beams) project, we have developed a Fast Multipole Method (FMM**)-based tool for higher fidelity modeling of particle accelerators for high-energy physics within Fermilab���s Synergi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::dd0f621283887ba269019e958b22dc55