scispace - formally typeset


About: Input/output is a(n) research topic. Over the lifetime, 11957 publication(s) have been published within this topic receiving 130889 citation(s). The topic is also known as: I/O & IO. more


Open accessJournal ArticleDOI: 10.1109/TC.1987.5009446
Abstract: Large grain data flow (LGDF) programming is natural and convenient for describing digital signal processing (DSP) systems, but its runtime overhead is costly in real time or cost-sensitive applications. In some situations, designers are not willing to squander computing resources for the sake of programmer convenience. This is particularly true when the target machine is a programmable DSP chip. However, the runtime overhead inherent in most LGDF implementations is not required for most signal processing systems because such systems are mostly synchronous (in the DSP sense). Synchronous data flow (SDF) differs from traditional data flow in that the amount of data produced and consumed by a data flow node is specified a priori for each input and output. This is equivalent to specifying the relative sample rates in signal processing system. This means that the scheduling of SDF nodes need not be done at runtime, but can be done at compile time (statically), so the runtime overhead evaporates. The sample rates can all be different, which is not true of most current data-driven digital signal processing programming methodologies. Synchronous data flow is closely related to computation graphs, a special case of Petri nets. This self-contained paper develops the theory necessary to statically schedule SDF programs on single or multiple processors. A class of static (compile time) scheduling algorithms is proven valid, and specific algorithms are given for scheduling SDF systems onto single or multiple processors. more

Topics: Synchronous Data Flow (61%), Compile time (58%), Data flow diagram (58%) more

1,356 Citations

Open accessJournal Article
01 Sep 1989-CWI quarterly
Abstract: The input output automaton model has recently been de ned in LT LT as a tool for modeling concurrent and distributed discrete event systems of the sorts arising in computer science Since its introduction the model has been used for describing and reasoning about several di erent types of systems including network resource allocation algorithms communication algorithms concurrent database systems shared atomic objects and data ow architectures This paper is intended to introduce researchers to the model It is orga nized as follows Section contains an overview of the model Section de nes the model formally and examines several illustrative examples concerning candy vending machines Section contains a second example a leader election algo rithm Finally Section contains a survey of some of the uses that have so far been made of the model more

Topics: Input/output (63%)

1,205 Citations

Journal ArticleDOI: 10.2307/1401808
01 Jan 1967-
Topics: Input/output (65%)

1,187 Citations

Open access
01 Jan 1965-
Abstract: Markov parametric algorithm for effective construction of minimal realizations of linear state-variable finite-dimensional dynamical systems from input-output data more

Topics: State variable (59%), Linear system (59%), Markov chain (57%) more

908 Citations

No. of papers in the topic in previous years

Top Attributes

Show by:

Topic's top 5 most impactful authors

Alok Choudhary

46 papers, 811 citations

Harry M. Yudenfriend

34 papers, 648 citations

Robert Ross

29 papers, 935 citations

Wei-keng Liao

17 papers, 330 citations

Mahmut Kandemir

15 papers, 182 citations

Network Information
Related Topics (5)
Robustness (computer science)

94.7K papers, 1.6M citations

87% related
Parametric statistics

39.2K papers, 765.7K citations

85% related
Linear programming

32.1K papers, 920.3K citations

84% related
Energy consumption

101.9K papers, 1.6M citations

83% related
Control system

129K papers, 1.5M citations

83% related