1 / 21

Welcome

Welcome. Bart’s Operating System Structure. BOSS. B.Visscher Aug 2001. Introduction. Design Goals What is BOSS Hardware Dependency Flow Model Implementation resources BOSS Perceptron application Conclusion Questions. Design Goals. Easy to understand and program

abner
Download Presentation

Welcome

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. Welcome

  2. Bart’s Operating System Structure BOSS B.Visscher Aug 2001

  3. Introduction • Design Goals • What is BOSS • Hardware • Dependency Flow Model • Implementation resources BOSS • Perceptron application • Conclusion • Questions

  4. Design Goals • Easy to understand and program • Transparent Hardware / Software • Fast • Reliable • Safe • Free

  5. Traditional v.s. BOSS Applications Applications Dependency Flow Model Operating System BOSS Hardware

  6. Resource2 Hardware Resource1 Resource3 Network Resources Linked Together in Network Resourcen Resourcen-1

  7. Resourcei Processor Memory Processor Processors Resource Environment / Side Effects Network

  8. Dependency Flow Model • Dependency Flow Networks • Programming • Owner structure • Abstraction • Process management • Resource Structure • Scheduling • Information • Security

  9. Dependency Flow Network Programming 1 • Sockets • Process • Ports • Storage • Channels • Communication Repeat + 2 3 5 8 13 21 etc.

  10. Owner structure Abstraction Process management • Owner holds DFN status • Suspend • Active • Terminate DFN DFN DFN Master Owner socket DFN Owner socket Owner socket DFN DFN Owner socket DFN

  11. Socket Socket Socket Socket Socket Socket Socket Socket Resource structure Scheduling Information Security • Socket : request for a process • Resource : provider of processes Resource

  12. Input Memory Local Memory Process Output Memory Socket • Part of • DFN • Owner structure • Resource structure • Represents • Resource process (atomic) • DFN (combined)

  13. Is the sum greater than 0? 0 + Hold > Abstraction Subroutine Function Numbers • Black Box = Owner • Behavioral description • Implicit • White Box = DFN • Dependency description • Explicit True / False

  14. LinkLoader Resource • Converts passive dependency data into working processes (DFN) • Manages Black box processes • Communicates variables • Introduces constants • Suspends / Activates / Terminates processes • Manages Namespaces • Primary namespace • Secondary namespace • Global namespace

  15. Complete Structure: BOSS Resource 0 LinkLoader Resource 1 Resource N Processor 1.P Processor 1.1 Processor N.K Processor N.1 Extension processes Extension processes LinkLoader processes Extension Extension Sockets Sockets Sockets Ports Ports Ports Network Channels

  16. Implemented processes • Naming of resource processes • <resource>.<process>(in0,in1…inn)(out0,out1…outn) • Resource: signal, boolean, byte, integer, float, double • Example: boolean.and(boolean,boolean)(boolean) • Example: integer.+(integer,integer)(integer) • Resource: flow • Processes: repeat, hold, sync, switch, merge, last, after • All processes for data types : signal,boolean,…,@,NIL) • Resource: text user interface, TUI

  17. TUI Resource Demo • Screen divided into multiple layers • Background color Background Layer N Layer 2 Screen Layer 1 Layer 0 Layer Holder

  18. * + * > + Hold Perceptron W0 W1 W2 X1 X2 • Running • Y’ = (W0 + W1 * X1 + W2 * X2) > 0 • Training (Determining W) • Y = True, Y’ = False -> (Y-Y’)=1 • Y = False, Y’ = True -> (Y-Y’)=-1 • Wi new = Wi old + (Y-Y’)*Xi • Y, Y’ : boolean {True, False} • X, W : integer {-n…-2,-1,0,1,2…n} 0 Y’

  19. Random Random Hold Hold Perceptron Demos True / False Random True • Random Value range: [–127,127] • W0, W1 W2: 1 • Training: True • Y: True, False, Random Training X1 X2 W0 W1 W2 Y Perceptron Y’ W0 W1 W2 W0 False False True W1 True W2 Random

  20. Conclusion • Easy to understand and program / Free • DFN • Owner structure / Abstraction • Information in resources • Transparent Hardware / Software • Atomic processes • Combined processes • Fast • Parallel execution of processes • Reliable / Safe • Resource structure • Autonomy of resources

  21. Questions

More Related