Design and Implementation of TinyGALS: A Programming Model for ...

More documents

Recommendations

Info

if there is an event in the global event queue then { if any TinyGUYS have been modified end if Copy buffered values into variables. Get token corresponding to event out of input port. Pass value to the method linked to the input port. else if there is a TinyOS task then { end if Take task out of task queue. Run task. 4.6 Memory Usage Figure 18: TinyGALS scheduling algorithm. Tables 1 and 2 show the sizes of the generated functions and variables for the system shown in Figure 17. Note that the system contains one port. Here, we assume that the method linked to A_out writes values of type short and returns a confirmation value of type char. Additionally, the queue connected to inport B_in is of size 50 (i.e., it holds 50 elements of type short). Thus, memory usage of a TinyGALS application is determined mainly by the user-specified queue sizes and total number of ports in the system. The Tiny- GALS communication framework is very lightweight, since event queues are generated as application-specific data structures. Table 3 compares the sizes of the TinyGALS and original TinyOS portions of the scheduler. The code size of the TinyGALS scheduler is only 114 bytes. For backwards compat- ibility with TinyOS tasks, we include the original 86 byte TinyOS scheduler. If TinyOS tasks are not used, the scheduler is about the same size as before. Refer to Section 6.1 on why TinyOS tasks are made obsolete by the TinyGALS model. 12 The queue holds 50 elements of type short. 36
Table 1: Sizes of generated functions Function Name Bytes of code (decimal) app_init() 58 app_start() 6 A_out() 12 B_in_put() 160 BCOMP1_FIRE() 98 A_param_PARAM_GET() 10 A_param_PARAM_PUT() 16 Table 2: Sizes of generated variables Variable Name Bytes (decimal) eventqueue_head 2 params 2 entrypoints 2 eventqueue_count 2 eventqueue 12 100 ports 12 104 params_buffer_flag 1 params_buffer 2 TinyGALS 114 TinyOS 86 Total 200 Table 3: Size of scheduler (number of bytes in decimal) 37
Page 1: Design and Implementation of TinyGA
Page 5 and 6: Contents 1 Introduction 1 2 The Tin
Page 7: 8 Acknowledgements 60 iii
Page 10 and 11: does not require synchronization, w
Page 12 and 13: integrate subsystems that share a c
Page 14 and 15: 2 The TinyGALS Programming Model Ti
Page 16 and 17: 2.2.1 TinyGALS Components Component
Page 18 and 19: Component implementation for COUNTE
Page 20 and 21: Module definition for leds. include
Page 22 and 23: uns in a single thread of execution
Page 24 and 25: as in a normal method call. 8 The g
Page 26 and 27: nondeterministic component firing o
Page 28 and 29: module. Tokens are placed in input
Page 30 and 31: Application def. include modules{ A
Page 32 and 33: 1. The values of all internal varia
Page 34 and 35: Conditions for well-formedness Here
Page 36 and 37: Determinacy of a system without glo
Page 38 and 39: I0 q0 I1 I2 In a 1 0,0 a 1 0,0 + a2
Page 40 and 41: app_init() app_start() statevar_PAR
Page 42 and 43: the same name as the output port. T
Page 46 and 47: 5 Example The TinyGALS programming
Page 48 and 49: the motes as three separate modules
Page 50 and 51: Table 4: Code size comparison of BL
Page 52 and 53: gered modules in TinyGALS and tasks
Page 54 and 55: critical section to maintain data i
Page 56 and 57: and a pull port is illegal. Every p
Page 58 and 59: Poll packet from receive DMA ring P
Page 60 and 61: Click router thread TinyGALS thread
Page 62 and 63: unlike Click, the TinyGALS model do
Page 64 and 65: 6.5 Timed Multitasking Timed multit
Page 66 and 67: quiescent system state to the next
Page 68 and 69: 8 Acknowledgements I wish to thank
Page 70 and 71: [11] S. S. Bhattacharyya, E. Cheong
Page 72 and 73: [31] T. J. Mowbray, W. A. Ruh, and

Design and Implementation of TinyGALS: A Programming Model for ...

You also want an ePaper? Increase the reach of your titles

Delete template?

Save as template?