Citations:superword

English citations of superword

• 1983, Mini-micro Systems‎^[1], volume 16, Cahners Publishing Company, page 238:

  Using two word sizes—an 8-bit word for the microprocessor and a much longer "superword" for the data comparisons—resolves the conflct between needing a […]

• 1988, Consultants Bureau., Programming and Computer Software‎^[2], volumes 14-15, Kluwer Online, page 78:

  Let D be a superword which stores data written into the memory or into which is read a superword of data from a multimodule memory. Also, let A be a superword of memory addresses and N, a word defining the amount of cyclic shifting of the […]

• 2000, Samuel Larsen, Saman Amarasinghe, “Exploiting Superword Level Parallelism with Multimedia Instruction Sets”, in ACM Sigplan Notices‎^[3], volume 35, number 5, retrieved 2024-04-13, pages 145–156:

  In the past, such systems could accommodate only small data types of 8 or 16 bits, making them suitable for a limited set of applications. With the emergence of 128-bit superwords, new architectures are capable of performing four 32-bit operations with a single instruction.

• 2002 September, IEEE Computer Society. Technical Committee on Computer Architecture, PACT 2002: 2002 International Conference on Parallel Architectures and Compilation Techniques : Proceedings : 22-25 September, 2002, Charlottesville, Virginia, USA‎^[4], illustrated edition, IEEE Computer Society, →ISBN, page 46:

  […] reuse is loaded from memory in a superword register. Therefore, in many cases the loop that carries the most superword-level parallelism also carries the most spatial reuse, and benefits from SLL optimizations.

• 2006, Frank Kogan, chapter 25, in Real Punks Don't Wear Black: Music Writing‎^[5], illustrated edition, University of Georgia Press, →ISBN:

  I'm estating the idea of Superwords here to highlight some points that might have gotten buried in chapter 7. Recall that a Superword is a word like “punk,” which is, among other things, a battleground, a weapon, a red cape, a prize, a flag in a bloody game of Capture the Flag. To put this in the abstract, a Superword is a word or phrase that not only is used in fights but that is itself fought over.

• 2011 May 3, Gokhan Tur, Renato De Mori, Spoken Language Understanding: Systems for Extracting Semantic Information from Speech‎^[6], John Wiley & Sons, →ISBN:

  This step includes (a) replacing the words in a semantic class with the class name; e.g. "Seattle" and "Los Angeles" are replaced with the superword “_cityname”; and (b) replacing a word sequence that matches a regular expression with a superword; e.g. “one hundred twenty five” is replaced with the superword “_number". Two problems arise, however, with this traditional solution:

• 2014 March 22, Henri Prade, Gilles Richard, “10 Analogical Proportions in a Lattice of Sets of Alignments Built on the Common”, in Computational Approaches to Analogical Reasoning: Current Trends‎^[7], illustrated edition, volume 548, Springer, →ISBN, page 249:

  The word w' = abcabbc is another superword of u and v, and w' < w. Thus, w is not a minimal superword of u and v. Then we demonstrate the proposition.

• 2021 January 15, Daria Bylieva, Alfred Nordmann, Olga Shipunova, Violetta Volkova, “Information Technologies for Philological Education in the Digital Age”, in Knowledge in the Information Society: Joint Conferences XII Communicative Strategies of the Information Society and XX Professional Culture of the Specialist of the Future‎^[8], volume 184, Springer Nature, →ISBN, page 268:

  The introductory lesson was devoted to terms “superword neologism” and “phraseological neologism”. The work with dictionaries (phraseological, eptological, of foreign words and expressions) showed students that the names of the chosen color revolutions did not undergo lexicographical changes; these names were superword neologisms.

• 2021 July 1, Maxime Crochemore, Thierry Lecroq, Wojciech Rytter, “Short Superword of Permutations”, in 125 Problems in Text Algorithms: with Solutions‎^[9], Cambridge University Press, →ISBN, page 41:

  For n = 2 the word 121 is a shortest 2-superword, since it contains the two 2-permutations 12 and 21. For n = 3, 123121321 is a shortest 3-superword. The six 3-permutations appear in it in the order π₁ = 123, π₂ = 231, π₃ = 312, π₄ = 213, π₅ = 132, π₆ = 321.

• (Can we date this quote?), PediaPress, “Code optimization”, in Compiler Construction‎^[10], PediaPress, page 373:

  Superword. Level. Parallelism. Superword level parallelism is a vectorization technique based on loop unrolling and basic block vectorization. It is available in the gcc 4.3 compiler.