1 / 18

HIGH-LEVEL LANGUAGE COMPUTER ARCHITECTURE

HIGH-LEVEL LANGUAGE COMPUTER ARCHITECTURE. Veljko Milutinovic vm@etf.bg.ac.yu Gorana Bosic gogaetf@gmail.com. Veljko M. Milutinovic “High-level language computer architecture” Computer science press, 1989 pp. VII-VIII, IX-XI, 387-410. /18. CLASSIFICATION. /18.

frey
Download Presentation

HIGH-LEVEL LANGUAGE COMPUTER ARCHITECTURE

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. HIGH-LEVEL LANGUAGECOMPUTER ARCHITECTURE Veljko Milutinovic vm@etf.bg.ac.yu Gorana Bosic gogaetf@gmail.com

  2. Veljko M. Milutinovic “High-level language computer architecture” Computer science press, 1989 pp. VII-VIII, IX-XI, 387-410 /18

  3. CLASSIFICATION /18

  4. The degree of incoding of an instruction set Number of registers Instruction cache size Processor cycle time PERFORMANCES /18

  5. PERFORMANCES PRECENDENCE ? GLOBAL TRAFFIC ? LANGUAGE ? DATAFLOW LANGUAGES REDUCTION LANGUAGES   /18

  6. THE IRVINE DATAFLOW DATABASE MACHNE • Many queries are processed concurently • The database must be fully distribuited • Instructions are triggered by the arrival of tokens /18

  7. AGM:THE IRVINE DATAFLOW DATABASE MACHINE t1 t2 e1 e2 PROF TEACH COURSE ENROLL STUD P2 CS /18

  8. THE MACHINE ARCHITECTURE /18

  9. INTERCONNECTION TOPOLOGY IOP PE PE PE IOP PE PE PE to host IOP PE PE PE /18

  10. STRUCTURE OF THE PHYSICAL NODE to host CPU C DISK RAM C C C C to neighbour PE nodes /18

  11. PROPAGATION OF TOKENS It is essential to minimize the number of tokens transmitted /18

  12. PROPAGATION OF TOKENS (3,2) FLOODING /18

  13. (3,2) PROPAGATION OF TOKENS DRAINING /18

  14. (3,2) (5,5) PROPAGATION OF TOKENS NODE-TO-NODE COMMUNICATION /18

  15. DATA INTEGRITY • A modification request must await the completion of all previous requests regardless of their types • A retrieval requests have to wait the completion of only the last modification /18

  16. COPY COPY ORIGINAL ORIGINAL HARDWARE FAILURES THE “BUDDY” SYSTEM BROKEN /18

  17. PEa CLab PEb CLbc PEc T RA T PA RA HARDWARE FAILURES TOKEN RECOVERY T T T T T T /18

  18. COMMUNICATION UNDER NODE FAILURE “MAZE SEARCHING” ALGORITHM /18

More Related