COTS Challenges for Embedded Systems - PowerPoint PPT Presentation

About This Presentation
Title:

COTS Challenges for Embedded Systems

Description:

E81 CSE 532S: Advanced Multi-Paradigm Software Development Proactor Pattern Venkita Subramonian & Christopher Gill Department of Computer Science and Engineering – PowerPoint PPT presentation

Number of Views:63
Avg rating:3.0/5.0
Slides: 18
Provided by: dschmidt
Category:

less

Transcript and Presenter's Notes

Title: COTS Challenges for Embedded Systems


1
E81 CSE 532S Advanced Multi-Paradigm Software
Development
Proactor Pattern
Venkita Subramonian Christopher Gill Department
of Computer Science and Engineering Washington
University, St. Louis cdgill_at_cse.wustl.edu
2
Proactor
  • An architectural pattern for asynchronous,
    decoupled operation initiation and completion
  • In contrast to Reactor architectural pattern
  • Synchronous, coupled initiation and completion
  • I.e., reactive initiation completes when hander
    call returns
  • Except for reactive completion only, e.g., for
    connector
  • Proactor separates initiation and completion more
  • Without multi-threading overhead/complexity
  • Performs additional bookkeeping to match them up
  • Dispatches a service handler upon completion
  • Asynch Handler does post-operation processing
  • Still separates application from infrastructure
  • A small departure vs. discussing other patterns
  • Well focus on using rather than implementing
    proactor
  • I.e., much of the implementation already given by
    the OS

3
Context
  • Asynchronous operations used by application
  • Application thread should not block
  • Application needs to know when an operation
    completes
  • Decoupling application/infrastructure is useful
  • Reactive performance is insufficient
  • Multi-threading incurs excessive overhead or
    programming model complexity

4
Design Forces
  • Separation of application from infrastructure
  • Flexibility to add new application components
  • Performance benefits of concurrency
  • Reactive has coarse interleaving (handlers)
  • Multi-threaded has fine interleaving
    (instructions)
  • Complexity of multi-threading
  • Concurrency hazards deadlock, race conditions
  • Coordination of multiple threads
  • Performance issues with multi-threading
  • Synchronization re-introduces coarser granularity
  • Overhead of thread context switches
  • Sharing resources across multiple threads

5
Compare Reactor vs. Proactor Side by Side
Reactor
Proactor
Application
Application
ASYNCH accept/read/write
handle_events
Reactor
Handle
handle_event
handle_events
Event Handler
Proactor
accept/read/write
handle_event
Handle
Completion Handler
6
Proactor in a nutshell
create handlers
Completion Handler2
Completion Handler1
Application
Proactor
I/O Completion port
OS (or AIO emulation)
7
Motivating Example A Web Server
From http//www.cs.wustl.edu/schmidt/PDF/proactor
.pdf
8
First Approach Reactive (1/2)
Web Server
Acceptor
HTTP Handler
Web Browser
Reactor
9
First Approach Reactive (2/2)
Web Server
read request
3
parse request
4
Acceptor
1
HTTP Handler
Web Browser
GET/etc/passwd
5
socket read ready
send file
register for file read
2
10
8
register for socket write
7
read file
Reactor
6
file read ready
File System
9
socket write ready
10
Analysis of the Reactive Approach
  • Application-supplied acceptor creates, registers
    handlers
  • A factory
  • Single-threaded
  • A handler at a time
  • Concurrency
  • Good with small jobs (e.g., TCP/IP stream
    fragments)
  • With large jobs?

From http//www.cs.wustl.edu/schmidt/PDF/proactor
.pdf
11
A Second Approach Multi-Threaded
  • Acceptor spawns, e.g., a thread-per-connection
  • Instead of registering handler with a reactor
  • Handlers are active
  • Multi-threaded
  • Highly concurrent
  • May be physically parallel
  • Concurrency hazards
  • Any shared resources between handlers
  • Locking / blocking costs

From http//www.cs.wustl.edu/schmidt/PDF/proactor
.pdf
12
A Third Approach Proactive
  • Acceptor/handler
  • registers itself with OS, not with a separate
    dispatcher
  • Acts as a completion dispatcher itself
  • OS performs work
  • E.g., accepts connection
  • E.g., reads a file
  • E.g., writes a file
  • OS tells completion dispatcher its done
  • Accepting connect
  • Performing I/O

From http//www.cs.wustl.edu/schmidt/PDF/proactor
.pdf
13
Proactor Dynamics
Asynch Operation Processor
Asynch Operation
Completion Dispatcher
Completion Handler
Application
Asynch operation initiated
invoke
execute
Operation runs asynchronously
Operation completes
dispatch
handle_event
Completion handler notified
Completion handler runs
From http//www.cs.wustl.edu/schmidt/PDF/proactor
.pdf
14
Asynch I/O Factory classes
  • ACE_Asynch_Read_Stream
  • Initialization prior to initiating read open()
  • Initiate asynchronous read read()
  • (Attempt to) halt outstanding read cancel()
  • ACE_Asynch_Write_Stream
  • Initialization prior to initiating write open()
  • Initiate asynchronous write write()
  • (Attempt to) halt outstanding write cancel()

15
Asynchronous Event Handler Interface
  • ACE_Handler
  • Proactive handler
  • Distinct from reactive ACE_Event_Handler
  • Return handle for underlying stream
  • handle()
  • Read completion hook
  • handle_read_stream()
  • Write completion hook
  • handle_write_stream()
  • Timer expiration hook
  • handle_time_out()

16
Proactor Interface (CNPV2 Section 8.5)
  • Lifecycle Management
  • Initialize proactor instance ACE_Proactor(),
    open ()
  • Shut down proactor ACE_Proactor(), close()
  • Singleton accessor instance()
  • Event Loop Management
  • Event loop step handle_events()
  • Event loop proactor_run_event_loop()
  • Shut down event loop proactor_end_event_loop()
  • Event loop completion proactor_event_loop_done()
  • Timer Management
  • Start/stop timers schedule_timer(),
    cancel_timer()
  • I/O Operation Facilitation
  • Input create_asynch_read_stream()
  • Output create_asynch_write_stream()

17
Proactor Consequences
  • Benefits
  • Separation of application, concurrency concerns
  • Potential portability, performance increases
  • Encapsulated concurrency mechanisms
  • Separate lanes, no inherent need for
    synchronization
  • Separation of threading and concurrency policies
  • Liabilities
  • Difficult to debug
  • Opaque and non-portable completion dispatching
  • Controlling outstanding operations
  • Ordering, correct cancellation notoriously
    difficult
Write a Comment
User Comments (0)
About PowerShow.com