Abstract-Embedded systems are evolving from traditional, stand-alone devices to devices that participate in Internet activity. The days of simple, manifest embedded software [e.g. a simple finite-impulse response (FIR) algorithm on a digital signal processor DSP)] are over. Complex, nonmanifest code, executed on a variety of embedded platforms in a distributed manner, characterizes next generation embedded software. One dominant niche, which we concentrate on, is embedded, multimedia software. The need is present to map large scale, dynamic, multimedia software onto an embedded system in a systematic and highly optimized manner. The objective of this paper is to introduce high-level, systematically applicable, data structure transformations and to show in detail the practical feasibility of our optimizations on three real-life multimedia case studies. We derive Pareto tradeoff points in terms of accesses versus memory footprint and obtain significant gains in execution time and power consumption with respect to the initial implementation choices. Our approach is a first step to systematically applying high-level data structure transformations in the context of memory-efficient and low-power multimedia systems.
In the popular imagination, the relevance of Turing's theoretical ideas to people producing actual machines was significant and appreciated by everybody involved in computing from the moment he published his 1936 paper 'On Computable Numbers'. Careful historians are aware that this popular conception is deeply misleading. We know from previous work by Campbell-Kelly, Aspray, Akera, Olley, Priestley, Daylight, Mounier-Kuhn, Haigh, and others that several computing pioneers, including Aiken, Eckert, Mauchly, and Zuse, did not depend on (let alone were they aware of) Turing's 1936 universal-machine concept. Furthermore, it is not clear whether any substance in von Neumann's celebrated 1945 'First Draft Report on the EDVAC' is influenced in any identifiable way by Turing's work. This raises the questions: (i) When does Turing enter the field? (ii) Why did the Association for Computing Machinery (ACM) honor Turing by associating his name to ACM's most prestigious award, the Turing Award? Previous authors have been rather vague about these questions, suggesting some date between 1950 and the early 1960s as the point at which Turing is retroactively integrated into the foundations of computing and associating him in some way with the movement to develop something that people call computer science. In this paper, based on detailed examination of hitherto overlooked primary sources, attempts are made to reconstruct networks of scholars and ideas prevalent in the 1950s, and to identify a specific group of ACM actors interested in theorizing about computations in computers and attracted to the idea of language as a frame in which to understand computation. By going back to Turing's 1936 paper and, more importantly, to re-cast versions of Turing's work published during the 1950s (Rosenbloom, Kleene, Markov), I identify the factors that made this group of scholars particularly interested in Turing's work and provided the original vector by which Turing became to be appreciated in retrospect as the father of computer science. E. G. Daylightbe named after one of the early great luminaries in the field (for example, 'The Von Neuman [sic] Award' or 'The Turing Award ', etc.) . (Association of Computing Machinery 1966b)The mathematician Alan J. Perlis officially became ACM's first A.M. Turing Lecturer and Turing Awardee in 1966. Besides having been the first editor-in-chief of the Communications of the ACM, Perlis had earned his stripes in the field of programming languages during the 1950s and had been President of the ACM in the early 1960s. Perlis was thus a wellestablished and influential computer scientist by the mid-1960s. In retrospect, decorating Perlis was only to be expected. But why did the ACM honor Turing? Turing was not well known in computing at large in the 1960s and early 1970s (Daylight 2012a). Apparently, his name was preferred over John von Neumann's and Emil Post's, yet all three researchers had deceased by 1957 and all three were highly respected by some very influential actors in the ACM-including John W. Ca...
Assessing the accuracy of popular descriptions of Alan Turing's influences and legacy.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.
customersupport@researchsolutions.com
10624 S. Eastern Ave., Ste. A-614
Henderson, NV 89052, USA
This site is protected by reCAPTCHA and the Google Privacy Policy and Terms of Service apply.
Copyright © 2024 scite LLC. All rights reserved.
Made with 💙 for researchers
Part of the Research Solutions Family.