Results 251 to 260 of about 7,552,821 (296)
Some of the next articles are maybe not open access.
Polarized data parallel data flow
Proceedings of the 5th International Workshop on Functional High-Performance Computing, 2016We present an approach to writing fused data parallel data flow programs where the library API guarantees that the client programs run in constant space. Our constant space guarantee is achieved by observing that binary stream operators can be provided in several polarity versions.
Ben Lippmeier, Fil Mackay, Amos Robinson
openaire +1 more source
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
Diagnosing Data Center Behavior Flow by Flow
2013 IEEE 33rd International Conference on Distributed Computing Systems, 2013Multi-tenant data centers are complex environments, running thousands of applications that compete for the same infrastructure resources and whose behavior is guided by (sometimes) divergent configurations. Small workload changes or simple operator tasks may yield unpredictable results and lead to expensive failures and performance degradation. In this
Ahsan Arefin +4 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
A Lubricant for Data Flow Analysis
SIAM Journal on Computing, 1982This paper deals with concepts recently introduced to avoid duplication of effort when several global data flow problems share the same underlying control flow. The flow scheme is the control flow portion of the input to data flow analysis. By finding a family of formal expressions called a flow cover for a given flow scheme, one can be ready to solve ...
openaire +2 more sources
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
Structured data flow programming
ACM SIGPLAN Notices, 1982Although both structured programming (particularly top-down stepwise refinement) [4,7,17] and a data flow view of parallel processing [1,8,11] have been with us now for many years, no attempt has been made to unite the two fields: This paper describes an experiment that unites the two areas in both a textual and a graphical framework.
M. D. de Jong, Chris Hankin
openaire +1 more source
IEEE Transactions on Software Engineering, 1984
The occurrence of a data flow anomaly is often an indication of the existence of a programming error. The detection of such anomalies can be used for detecting errors and to upgrade software quality. This paper introduces a new, efficient algorithm capable of detecting anomalous data flow patterns in a program represented by a graph.
Jacek Jachner, Vinod K. Agarwal
openaire +1 more source
The occurrence of a data flow anomaly is often an indication of the existence of a programming error. The detection of such anomalies can be used for detecting errors and to upgrade software quality. This paper introduces a new, efficient algorithm capable of detecting anomalous data flow patterns in a program represented by a graph.
Jacek Jachner, Vinod K. Agarwal
openaire +1 more source