Results 251 to 260 of about 2,992,402 (305)
Some of the next articles are maybe not open access.
Proceedings of the IEEE, 1987
Data flow is a natural paradigm for describing DSP applications for concurrent implementation on parallel hardware. Data flow programs for signal processing are directed graphs where each node represents a function and each arc represents a signal path.
Edward A. Lee, David G. Messerschmitt
openaire +1 more source
Data flow is a natural paradigm for describing DSP applications for concurrent implementation on parallel hardware. Data flow programs for signal processing are directed graphs where each node represents a function and each arc represents a signal path.
Edward A. Lee, David G. Messerschmitt
openaire +1 more source
ACM SIGOPS Operating Systems Review, 2011
Reducing power consumption of Mobile Internet Devices (MID) and smartphones is critical as battery life is a key feature for mobility. Most vendors use System-On-Chip designs integrating more and more fixed-function hardware modules in a bid to reduce power consumption. On the other hand the explosion of new applications has increased the demand for PC-
Arun Raghunath, John Keys, Mona Vij
openaire +1 more source
Reducing power consumption of Mobile Internet Devices (MID) and smartphones is critical as battery life is a key feature for mobility. Most vendors use System-On-Chip designs integrating more and more fixed-function hardware modules in a bid to reduce power consumption. On the other hand the explosion of new applications has increased the demand for PC-
Arun Raghunath, John Keys, Mona Vij
openaire +1 more source
Computer, 1979
The author states that in a data flow language, locality of effect is easily achieved. But obtaining freedom from side effects requires a fundamental alteration in the execution model of the language. 34 references.
openaire +1 more source
The author states that in a data flow language, locality of effect is easily achieved. But obtaining freedom from side effects requires a fundamental alteration in the execution model of the language. 34 references.
openaire +1 more source
Fundamenta Informaticae, 2000
An algebra of processes is proposed in which processes are modelled in terms of data rather than events. Structures representing processes are similar to the labelled event structures of Winskel (1982), but they denote flows of data. For processes represented in such a way operations similar to those of CCS (the Calculus of Communicating Systems as ...
openaire +2 more sources
An algebra of processes is proposed in which processes are modelled in terms of data rather than events. Structures representing processes are similar to the labelled event structures of Winskel (1982), but they denote flows of data. For processes represented in such a way operations similar to those of CCS (the Calculus of Communicating Systems as ...
openaire +2 more sources
IEEE Transactions on Computers, 1977
This paper presents the architecture of a highly concurrent multiprocessor which runs programs expressed in data flow notation. Sequencing of data flow instruction execution depends only on the availability of operands required by instructions. Because data flow instructions have no side effects, unrelated instructions can be executed concurrently ...
openaire +2 more sources
This paper presents the architecture of a highly concurrent multiprocessor which runs programs expressed in data flow notation. Sequencing of data flow instruction execution depends only on the availability of operands required by instructions. Because data flow instructions have no side effects, unrelated instructions can be executed concurrently ...
openaire +2 more sources
IEEE Transactions on Software Engineering, 1980
It is known that not aU paths are possible in the run time control flow of many programs. It is also known that data flow analysis cannot restrict attention to exactly those paths that are possible. It is, therefore, usual for analytic methods to consider aU paths.
L. Howard Holley, Barry K. Rosen
openaire +2 more sources
It is known that not aU paths are possible in the run time control flow of many programs. It is also known that data flow analysis cannot restrict attention to exactly those paths that are possible. It is, therefore, usual for analytic methods to consider aU paths.
L. Howard Holley, Barry K. Rosen
openaire +2 more sources
Computer, 1980
Programmability with increased performance? New strategies to attain this goal include two approaches to data flow architecture: data flow multiprocessors and the cell block architecture.
openaire +1 more source
Programmability with increased performance? New strategies to attain this goal include two approaches to data flow architecture: data flow multiprocessors and the cell block architecture.
openaire +1 more source
1974
A data flow schema is a representation of the logical scheme of a program in a form in which the sequencing of function and predicate applications and the flow of values between applications are specified together. In a data flow schema, application of a function or predicate is free to proceed as soon as the values required for its application are ...
Jack B. Dennis +2 more
openaire +1 more source
A data flow schema is a representation of the logical scheme of a program in a form in which the sequencing of function and predicate applications and the flow of values between applications are specified together. In a data flow schema, application of a function or predicate is free to proceed as soon as the values required for its application are ...
Jack B. Dennis +2 more
openaire +1 more source
Data Flow Testing for SystemC-AMS Timed Data Flow Models
2019 Design, Automation & Test in Europe Conference & Exhibition (DATE), 2019Internet-of-Things (IoT) devices have significantly increased the need for high quality Analog Mixed Signal (AMS) System-on-Chips (SoC). Virtual Prototyping (VP) can be utilized for an early design verification. The Timed Data Flow (TDF) model of computation available in SystemC-AMS offers here a good trade-off between accuracy and simulation-speed at ...
Muhammad Hassan 0002 +3 more
openaire +1 more source
Proceedings of the 6th international conference on Supercomputing - ICS '92, 1992
The Manchester Data-Flow Machine, MDFM, has evolved continuously during the past decade. By the time the prototype uniprocessor hardware system was decommissioned, in 1989, the putative multi-processor architecture comprised separate Processing Elements and Structure Store Units, together with a “global” Allocator and Throttle Unit, all linked by a ...
Gurd, John R, Snelling, David F
openaire +3 more sources
The Manchester Data-Flow Machine, MDFM, has evolved continuously during the past decade. By the time the prototype uniprocessor hardware system was decommissioned, in 1989, the putative multi-processor architecture comprised separate Processing Elements and Structure Store Units, together with a “global” Allocator and Throttle Unit, all linked by a ...
Gurd, John R, Snelling, David F
openaire +3 more sources