Zobrazeno 1 - 10
of 65
pro vyhledávání: '"Monroe, Laura"'
Star-product graphs are a natural extension of the Cartesian product, but have not been well-studied. We show that many important established and emerging network topologies, including HyperX, SlimFly, BundleFly, PolarStar, mesh, and torus, are in fa
Externí odkaz:
http://arxiv.org/abs/2403.12231
Autor:
Lakhotia, Kartik, Monroe, Laura, Isham, Kelly, Besta, Maciej, Blach, Nils, Hoefler, Torsten, Petrini, Fabrizio
Publikováno v:
In Proceedings of the 36th ACM Symposium on Parallelism in Algorithms and Architectures 2024 (SPAA '24). ACM, New York, NY, USA, pages 345 - 357
We present PolarStar, a novel family of diameter-3 network topologies derived from the star product of low-diameter factor graphs. PolarStar gives the largest known diameter-3 network topologies for almost all radixes, thus providing the best known s
Externí odkaz:
http://arxiv.org/abs/2302.07217
Autor:
Lakhotia, Kartik, Besta, Maciej, Monroe, Laura, Isham, Kelly, Iff, Patrick, Hoefler, Torsten, Petrini, Fabrizio
In this paper we present PolarFly, a diameter-2 network topology based on the Erdos-Renyi family of polarity graphs from finite geometry. This is a highly scalable low-diameter topology that asymptotically reaches the Moore bound on the number of nod
Externí odkaz:
http://arxiv.org/abs/2208.01695
Autor:
Mastripolito, Benjamin, Koskelo, Nicholas, Weatherred, Dylan, Pimentel, David A., Sheppard, Daniel, Graham, Anna Pietarila, Monroe, Laura, Robey, Robert
Publikováno v:
J. Comput. Inf. Sci. Eng. Apr 2022, 22(2)
Applications often require a fast, single-threaded search algorithm over sorted data, typical in table-lookup operations. We explore various search algorithms for a large number of search candidates over a relatively small array of logarithmically-di
Externí odkaz:
http://arxiv.org/abs/2112.03229
Autor:
Monroe, Laura
Publikováno v:
Journal of Integer Sequences, Vol. 27 (2024), Article 24.2.7
The number of unbalanced interior nodes of divide-and-conquer trees on $n$ leaves is known to form a sequence of dilations of the Takagi function on dyadic rationals. We use this fact to derive identities on the Takagi function and on the Hamming wei
Externí odkaz:
http://arxiv.org/abs/2111.05996
Autor:
Monroe, Laura
The binary signed-digit representation of integers is used for efficient computation in various settings. The Stern polynomial is a polynomial extension of the well-studied Stern diatomic sequence, and has itself has been investigated in some depth.
Externí odkaz:
http://arxiv.org/abs/2108.12417
Autor:
Monroe, Laura
Full binary trees naturally represent commutative non-associative products. There are many important examples of these products: finite-precision floating-point addition and NAND gates, among others. Balance in such a tree is highly desirable for eff
Externí odkaz:
http://arxiv.org/abs/2108.11496
Autor:
Monroe, Laura
Publikováno v:
Des. Codes Cryptogr. 89 (2021) 1-10
Stern's diatomic sequence is a well-studied and simply defined sequence with many fascinating characteristics. The binary signed-digit representation of integers is an alternative representation of integers with much use in efficient computation, cod
Externí odkaz:
http://arxiv.org/abs/2108.11495
Autor:
Monroe, Laura
Stern's diatomic sequence is a well-studied and simply defined sequence with many fascinating characteristics. The binary signed-digit (BSD) representation of integers is used widely in efficient computation, coding theory and other applications. We
Externí odkaz:
http://arxiv.org/abs/2103.05810
Autor:
Monroe, Laura, Job, Vanessa
Floating-point addition on a finite-precision machine is not associative, so not all mathematically equivalent summations are computationally equivalent. Making this assumption can lead to numerical error in computations. Proper ordering and parenthe
Externí odkaz:
http://arxiv.org/abs/2005.05387