Flag-algebra: a new concept for the realisation of fully parallel associative architectures

Access Full Text

Flag-algebra: a new concept for the realisation of fully parallel associative architectures

For access to this article, please select a purchase option:

Buy article PDF
£12.50
(plus tax if applicable)
Add to cart
Buy Knowledge Pack
10 articles for £75.00
(plus taxes if applicable)
Add to cart

IET members benefit from discounts to all IET publications and free access to E&T Magazine. If you are an IET member, log in to your account and the discounts will automatically be applied.

Learn more about IET membership 

Recommend Title Publication to library

You must fill out fields marked with: *

Librarian details
Name:*
Email:*
Your details
Name:*
Email:*
Department:*
Why are you recommending this title?
Select reason:
 
 
 
 
 
IEE Proceedings E (Computers and Digital Techniques) — Recommend this title to your library

Thank you

Your recommendation has been sent to your librarian.

© The Institution of Electrical Engineers
Published

The paper describes a new concept for the design of parallel-working associative memory and processor architectures, which is able to process arithmetical operations as well as complex search-operations for the sets of data in parallel. The proposed concept is based on a transformation method. It maps a set of word-oriented data into flag-oriented data. Each word of the set is represented each by a flag in a flagvector. The position of a flag in the flagvector is defined by the transformation and corresponds to the value of the transformed word. To obtain parallelism for various operations, the flags of the flagvector will be processed simultaneously. The result of these operations will also be flags. They can be retransformed to word-oriented data. A new algebra called flag-algebra to investigate operations on the flagvector will be introduced. This algebra is the isomorph to the set-theory and Boolean algebra. The most important axioms and laws of calculation in this algebra will be described. They can be seen as a substantial basis for the development of flag-oriented hardware systems. Based on this algebra, the architecture of an associative monoprocessor will be presented to process arithmetical as well as complex search operations in parallel. Furthermore, some languages adequate for this architecture and the performance of the processor will be discussed.

Inspec keywords: memory architecture; parallel architectures; Boolean algebra; content-addressable storage

Other keywords: flag-oriented data; word-oriented data; arithmetical operations; fully parallel associative architectures; Boolean algebra; set-theory; parallel-working associative memory; transformation method; complex search-operations; flag-algebra; flagvector

Subjects: Storage system design; Formal logic; Computer architecture; Other digital storage

References

    1. 1)
      • R.W. Hockney , C.R. Jesshope . (1981) , Parallel Computers.
    2. 2)
      • C. Fernstrom , I. Kruzela , B. Svensson . (1986) LUCAS — Associative Array Processor, Lecture Notes in Computer Science.
    3. 3)
      • M. Strugala , G. Roll , D. Tavangarian , K. Waldschmidt . (1987) , An Associative Processor as a Design Accelerator.
    4. 4)
      • D.A. Savitt . (1967) , ASP-A New Concept in Language and Machine Organization.
    5. 5)
      • D. Tavangarian . (1986) Flagorientierte Arithmetik-Logik-Einheiten für inhaltsadressierbare Daten, NTG/GI-Fachtagung Architektur und Betrieb von Rechensystemen.
    6. 6)
      • M. Flynn . Some Computer Organisations and their Effectiveness. IEEE Trans. Comp.
    7. 7)
      • G. Roll , M. Strugala , D. Tavangarian , K. Waldschmidt . (1986) Ein Assoziativprozessor auf der Basis eines modularen vollparallelen Assoziativspeicher- feldes, NTG/GI- Fachtagung Architektur und Betrieb von Rechensystemen.
    8. 8)
      • K. Hwang , F.A. Brigges . (1986) , Computer Architecture and Parallel Processing.
    9. 9)
      • Wilson, D.E.: `Support Software', IEEE CommpCon, 1972.
    10. 10)
      • K.L. Thurber , K.J.L.D. Wald . Associative and Parallel Processors. Comput. Surv. , 4
    11. 11)
      • Darianian, M., Schulz, M., Tavangarian, D., Waldschmidt, K.: `An Associative Co-Processor Architecture with the UNIX Operating System for Acceleration of CAD Tools', International MIMI Conference, 1988, .
    12. 12)
      • A. Bode , W. Händler . (1982) , Rechnerarchitektur.
    13. 13)
      • W.D. Hillis . (1985) , The Connection Machine.
    14. 14)
      • A.V. Aho , J.E. Hopcroft , J.D. Ullman . (1983) , Data Structures and Algorithms.
    15. 15)
      • J.A. Feldman , P.D. Rover . (1969) , An ALGOL based Associative Language.
    16. 16)
      • D. Tavangarian . Associative Random Access Memory. Elektronische Rechenanlagen , 5
    17. 17)
      • E.F. Code . (1970) , A Relational Model of Data for Large Shared Data-banks.
    18. 18)
      • K. Waldschmidt . (1987) , Associative Memories and Processors.
    19. 19)
      • C. Ramamoorthy , J.L. Turner , B.W. Wah . A Design of a Fast Cellular Associative Memory for Ordered Retrieval. IEEE Trans. Comp. , 9
    20. 20)
      • Schmidt, J.W., Mall, M.: Rep. 66, PASCAL/R-Report, 1980.
    21. 21)
      • H.A. Stüttgen . (1985) Hierarchical Associative Processing System, Lecture Notes in Computer Science.
    22. 22)
      • S.S. Yau , H.S. Fung . Associative Processor Architectures — A Survey. Comput. Surv. , 1
http://iet.metastore.ingenta.com/content/journals/10.1049/ip-e.1989.0048
Loading

Related content

content/journals/10.1049/ip-e.1989.0048
pub_keyword,iet_inspecKeyword,pub_concept
6
6
Loading