GLORIA

GEOMAR Library Ocean Research Information Access

X
feed icon rss

Your email was sent successfully. Check your inbox.

An error occurred while sending the email. Please try again.

Proceed reservation?

Export
  • 1
    Electronic Resource
    Electronic Resource
    A flow-mode, self-steering, cellular multiplier-summation processor (1970)
    Springer
    BIT 10 (1970), S. 125-144 
    Details
    ISSN: 1572-9125
    Keywords: Cellular Logic ; Iterative Array ; Vector Processing ; Flow Mode ; Self-Steering Asynchronous Control ; Arithmetic ; 6.1 ; 6.32 ; 6.33
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract Flow-mode or stream-processing digital systems have been proposed in which code, control and data are constantly moving so that multiple instructions are processed concurrently. We show the design of a flow-mode cellular array processor which can perform a number of two's complement fixed-point arithmetic operations. These operations are: three operand addition and/or subtraction, two operand multiplication and vector inner-product. Operand sizes are: 2N bit for addition and subtraction operands, andN bit for multiplication operands. Results are 2N bit. The network can simultaneously operate on 4N+2 datasets with any mix of the above operations being handled. The processor is based on the use of asynchronous cellular arrays. Given a continued flow of input datasets, the effective computation time is worst-case propagation time within one cell. A typical cell contains a 1-bit position 3-input full adder with associated input data storage. Thus the effective computation time is independent of the operand bit length.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01936862
    Location Call Number Limitation Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 2
    Electronic Resource
    Electronic Resource
    Flowchart machines (1970)
    Springer
    BIT 10 (1970), S. 415-442 
    Details
    ISSN: 1572-9125
    Keywords: Program flowcharts ; finite state machines ; graphs ; push-down machines ; canonical programs ; computer organization ; regular- ; deterministic-and definite computations ; 4.20 ; 5.22–24 ; 5.32 ; 6.20 ; 6.33
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract Let ℱ denote a conventional flowchart. Any algorithm can be represented by a flowchart. If action nodes in ℱ call ℱ then ℱ is a recursive flowchart. We show how to decompose arbitrary non-self-modifying programs into structure and atomic parts. We specifically give the synthesis procedure for a controller ℳ. ℳ can serve as the only sequencer in an execution of ℱ. If ℱ is recursive then ℳ is a pushdown machine, otherwise ℳ is a finite state machine. The next-state functionf and the output functiong of ℳ represent respectively all of the structure-, i.e. the programmer-oriented-, and all of the atomic-, i.e. the data-oriented-, parts of ℱ.f defines the flow or pattern of computations andg the actual transformations or operations on data. Thus we construct and analyze programs by constructing and analyzing their sequencers ℳ.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01935563
    Location Call Number Limitation Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...