![Loading...](https://link.springer.com/static/c4a417b97a76cc2980e3c25e2271af3129e08bbe/images/pdf-preview/spacer.gif)
-
Chapter and Conference Paper
Dumbo, A Schematic-to-Layout Compiler
This paper describes a technique for compiling logic circuit descriptions into layout and a program, Dumbo, to demonstrate the technique. Cells are described to the compiler as structural primitives, which des...
-
Article
The search for organic nutrient standards
The search for organic nutrient standards is approached from two sides. On the one hand, useful standards are selected from currently available SRMs; on the other hand, a representative food is developed repre...
-
Chapter
Overview of the IDA System: A Toolset for VLSI Layout Synthesis
The Integrated Design Aides (IDA) toolset is a set of VLSI CAD software programs that have been developed to make the most effective use possible of a designer’s time. IDA incorporates a number a layout synthe...
-
Book
-
Chapter
Architectural Optimization Methods for Control-Dominated Machines
We are building the Princeton University Behavioral Synthesis System (PUBSS) as a testbed for high-level synthesis methods. Our research in high-level synthesis is guided by two principles: concentration on co...
-
Book
-
Chapter
Introduction
There are few industries which, like the electronics industry, can continuously improve qualities of products and at the same time lower their prices every year. The growth rate of the electronics industry is ...
-
Chapter
System Specification
We describe the embedded system behavior by task graphs. The task graph model is similar to those used in distributed system scheduling and allocation problems [36, 80, 76, 55]. The task graphs represent what fun...
-
Chapter
Conclusions
Distributed computers are often the most cost-effective means of meeting the performance requirements of an embedded computing application. Embedded distributed computing is a particularly challenging design p...
-
Chapter
Communication Analysis and Synthesis
Communication analysis and synthesis is an essential step in distributed system co-synthesis. Many embedded systems use custom communication topologies and the communication links are often a significant part ...
-
Chapter and Conference Paper
Video as scholarly material in the digital library
Video is a challenging material for digital libraries because it contains large amounts of data which must be processed quickly and because video programming has not been as conveniently structured for algorit...
-
Chapter
Sensitivity-Driven Co-Synthesis
This chapter describes new techniques for the co-synthesis of real-time distributed embedded systems. Embedded system synthesis is co-synthesis because the hardware and software must be designed together to me...
-
Chapter
Previous Work
Performance analysis algorithms are critical for system optimization and to ensure that the system meets the real-time deadlines. Software performance analysis is difficult because software execution is less d...
-
Chapter
Performance Analysis
This chapter describes a new, efficient analysis algorithm [111, 112] to derive tight bounds on the worst-case response time required for an application task executing on a heterogeneous distributed system. Ti...
-
Chapter
Performance Analysis of Embedded Systems
Embedded computer systems are characterized by the presence of one or more processors running application specific software. A large number of these systems must satisfy performance constraints in addition to ...
-
Article
Lessons from the design of a PC-based private branch exchange
We designed TigerSwitch, a digital private branch exchange (PBX) implemented on an IBM PC-compatible platform, as an experiment in embedded system design. A telephone switching system is an interesting example...
-
Book
-
Chapter
Hardware/Software Co-Synthesis Algorithms
This chapter surveys methodologies and algorithms for hardware-software cosynthesis. While much remains to be learned about co-synthesis, researchers in the field have made a great deal of progress in a short ...
-
Article
Redundancy Removal during High-Level Synthesis Using Scheduling Don‘t-Cares
Previous work in automata theory has shown how to eliminate sequential redundancy from networks of FSMs by finding sequences of inputs and outputs which are never communicated between components of the network...
-
Article
Guest Editors' Introduction