Scalable Multi-Tasking using Preemption Thresholds
|
|
- Rudolf Price
- 6 years ago
- Views:
Transcription
1 Scalable Multi-Tasking using Preemption Thresholds Manas Saksena Department of Computer Science University of Pittsburgh Pittsburgh, PA 15260, USA Yun Wang Department of Computer Science Concordia University Montreal, QC H3G 1M8, Canada y wang@cs.concordia.ca Abstract Preemptive multi-tasking is a commonly used architecture for designing and implementing embedded real-time software. However, preemptive multi-tasking comes with its own costs. These costs include overheads due to preemptions and context-switches that result in waste of CPU bandwidth. Also, each task incurs a memory cost largely due to the need to maintain a separate stack for each task. These costs increase with the number of tasks and can be significant in complex real-time software. In this paper, we propose results from our ongoing research in which we are developing a design method with scalable multi-tasking implementations for complex realtime software. Our design method is based on an extension of fixed priority preemptive scheduling using preemption thresholds that was proposed in [15]. Using this new scheduling model we show how we can design multi-tasking implementations that are far more scalable than using pure preemptive multi-tasking implementations. 1. Introduction Preemptive multi-tasking is widely used as an implementation architecture for real-time systems, and is supported by virtually all real-time operating systems. There are clearly many benefits of preemptive multi-tasking, especially as compared to the traditional cyclic-executive model of developing real-time systems [9]. It allows efficient use of resources at run-time, and can be used to get small latencies for more urgent tasks. Also, with the advancements in real-time scheduling theory, it is possible to analyze suitably restricted implementations for schedulability. The most popular and well-developed analysis, often known as generalized ratemonotonic analysis [8], is based on fixed priorities for tasks The scheduling model is based on recurring periodic and sporadic tasks. Periodic tasks recur periodically with a fixed inter-arrival time, i.e., its period, and are triggered by a periodic timer. Sporadic tasks, on the other hand are triggered by an aperiodic event (e.g., an interrupt), and have a minimum inter-arrival time (which is also called its period). A task is assumed to perform a bounded amount of work on each release, which is characterized by its worst-case execution time. The benefits of preemptive multi-tasking come with a cost. These costs include loss of CPU bandwidth due to preemptions and context switches. Also, there is a pertask memory cost, largely due to the the need to maintain a separate stack for each task. In systems with small number of tasks, the advantages of preemptive multi-tasking clearly outweigh the disadvantages due to the costs. However, these costs also make scalability a problem for complex real-time software which can have a large number of tasks. Identification of tasks is a crucial step in real-time software design and implementation [6, 4]. Some design methods (e.g., DARTS [6], HRT-HOOD [3]) propose early identification of tasks and use tasks as structuring units. On the other hand, many object-oriented design methods defer identification of tasks to late design stage (e.g., ROPES [4], ROOM [12], and OCTOPUS [1]). In either case, an important influence on task identification is performance concerns, which includes meeting the real-time responsiveness requirements and minimizing run-time overheads.
2 Events are retrieved from from a priority queue. Process event by calling an appropriate function. Initialize Wait for Event Process Event Terminate Figure 1. Behavior of an Event-Handling Task While in simple systems it may be possible to create a task for each external and internal event, this is usually not feasible in complex systems that may have hundreds of possible events. A large number of tasks results in both loss of CPU bandwidth and increased memory overheads. This is especially significant when tasks are fine-grained, as would be likely if each event was handled in a separate task. Consequently, most design methods provide guidelines to group events into tasks for implementation [4, 12, 6, 1]. As a result of this grouping of events, each implementation task, in general, performs multiple functions by handling multiple event streams from possibly several sources. In object-oriented designs it is common to group all requests to one or more objects in a single implementation task [12, 1]. For example, the MARS Pathfinder system used such an implementation architecture [13]. In this implementation architecture, each task is implemented as an event handler as shown in Figure 1. A task has an event queue, where events are queued upon arrival or generation. Events may arrive from external sources (e.g., interrupts), be generated by passage of time (through timer services) and may be explicitly generated by other tasks (internal communication using message passing). In each iteration of the event handling loop, a task processes one event. While the use such event-triggered multi-tasking reduces costs of multi-tasking due to fewer tasks, it creates a difficulty for the designer to decide on a suitable implementation architecture for a given design. A designer must now decide on how many tasks to use and how to map events to tasks. Clearly, the choice of the implementation architecture must be guided by schedulability constraints. Unfortunately, this event-triggered task model conflicts with the basic assumptions of generalized rate-monotonic scheduling theory since a task may be processing events with different timing requirements (arrival rates and deadlines) and different execution times. The implementation model also results in non-preemptability into the scheduling model since within each task, events are processed in a run-to-completion manner. In this paper, we present results from our ongoing research in which we are looking at schedulability analysis and automated synthesis of event-triggered multitasking implementations, especially in the context of objectoriented designs. Our approach is based on a new scheduling model that extends fixed priority preemptive scheduling using preemption thresholds [15]. We show that this new scheduling model serves as a basis for scalable event-triggered multi-tasking as described above. The new scheduling model allows us to assess schedulability of a particular implementation architecture, which, in turn, provides a basis for automatic synthesis of a scalable implementation architecture from a design model. The rest of the paper is organized as follows. In Section 2, we present the new scheduling model and show its benefits over fixed priority, preemptive scheduling. Then, in Section 3, we show how to make use of the new scheduling model for designing scalable multi-tasking implementations. Finally, we present two simple case studies that highlight the benefits of our approach. 2. Preemption Threshold Scheduling Model The preemption threshold scheduling model is an extension of fixed priority preemptive scheduling model. In this scheduling model, each task has a preemption threshold, in addition to its priority. In essence this results in a dual priority system. Each task has a regular priority, which is the priority at which is is queued when released. Once a task gets the CPU, its priority is raised to its preemption threshold. It keeps this priority until the end of its execution. For recurring tasks, this process repeats each time the task is released. The response time analysis for this scheduling model is similar to the standard response time analysis for fixed pri-
3 ority preemptive scheduling using the notions of critical instant and busy periods [8]. In [15] we developed the response time analysis for a set of periodic and sporadic task sets for this scheduling model. While the scheduling model is relatively simple, it provides many benefits by integrating the best of preemptive and non-preemptive scheduling models. The following sub-sections highlight some of the benefits of the scheduling model as well as how to determine feasible scheduling attributes (priorities and preemption thresholds) for tasks Integration of Preemptive and Non-Preemptive Scheduling The preemption threshold scheduling model integrates and subsumes both preemptive and non-preemptive scheduling models. If the preemption threshold of each task is the same as its priority, the model reduces to pure preemptive scheduling. On the other hand, if the preemption threshold of each task is the highest priority value, then we have the case of non-preemptive scheduling. By choosing an appropriate preemption threshold value, we are potentially able to take advantage of the best of both preemptive and non-preemptive scheduling models, and in fact do better than either. In the context of fixed priority scheduling, it is easy to construct example task sets that are schedulable under preemptive scheduling but not under non-preemptive scheduling and vice-versa. Since, the preemption threshold scheduling model is a generalization of both the preemptive and non-preemptive scheduling models, it follows that it dominates both preemptive and non-preemptive scheduling models. That is, if a task set is schedulable under either preemptive or non-preemptive scheduling, then it is also schedulable using preemption thresholds. Moreover, we can construct task sets that are schedulable with preemption thresholds, but not schedulable under either preemptive or non-preemptive scheduling. Also, using simulations over randomly generated task sets we have seen that using preemption thresholds we can increase the breakdown utilization by as much as 10-15% in a significant percentage of task sets Assignment of Feasible Scheduling Attributes For both preemptive and non-preemptive scheduling, an optimal algorithm exists that can find a feasible priority assignment for a set of periodic and sporadic tasks with arbitrary deadlines [14, 5]. The problem of finding feasible scheduling attributes is significantly harder with preemption threshold scheduling due to the extra attributes (each task has a priority and preemption threshold) and the non linear relationships between the attributes and their effect on response times. In [15] we presented an efficient algorithm to find feasible preemption thresholds for a given priority assignment. Using that algorithm as a base, we have developed (a) an optimal, but expensive, search algorithm, (b) an, efficient, but sub-optimal, greedy heuristic algorithm, and (c) an algorithm using simulated annealing to generate a feasible assignment of both priorities and preemption thresholds. Our ongoing work is evaluating the effectiveness of these algorithms Eliminating Unnecessary Preemptability While the above approach generates feasible scheduling attributes, it does not attempt to reduce unnecessary preemptability in the scheduling model. Reducing unnecessary preemptability is a key ingredient of our approach as will become clear in Section 3. Certainly, in the extreme case a task set may be schedulable under non-preemptive scheduling, and we can use that. In general, however, this will not be true, and we must chose preemption thresholds for tasks that are as high as possible, without sacrificing schedulability. We have developed an algorithm that does just that. The algorithm works by considering one task at a time, going from higher priority to lower priority. For each task considered, we assign the highest preemption threshold value that will still keep the task set schedulable. 3. Designing Scalable Multi-Tasking Implementations In this section we show how a design model consisting of a set of periodic and sporadic tasks can be efficiently implementing using a small number of event-handling tasks (Figure 1). A smaller number of tasks at implementation results in fewer preemptions and context switches 1. It also results in significant memory savings due to the need to have fewer stacks. We will assume that a design model consists of a set of periodic and sporadic tasks. Each such task is triggered 1 Note that within an event-handling task, the cost of switching from one event to the next is minimal, since there is no context to be saved.
4 by an event ( ), and executes an action ( ). We will ignore any dependencies between tasks. Our ongoing work is extending the approach to include various dependencies between tasks. At implementation we will use a set of event handling tasks. Each event is then mapped to one of the implementation tasks. At run time, the underlying executive uses this mapping to insert the event into its target task s event-queue from which the event gets processed by executing the action associated with it. Our strategy to map this design model into an implementation consists of the following steps: (1) First, we use the set of tasks in the design model and generate a feasible assignment of priorities and preemption thresholds. We then refine this assignment to eliminate any unnecessary preemptability, while still maintaining feasibility, as discussed in Section 2.3. (2) We then use this assignment of scheduling attributes to partition the tasks into the smallest number of nonpreemptive groups. This is discussed in Section 3.1. (3) Finally, we implement each non-preemptive group in an event-handling task. The priority of these eventhandling tasks is dynamically managed such that the schedulability equations of the implemented model is the same as that of the design model. This ensures that the implementation preserves schedulability. The dynamic priority management of event handling tasks is discussed in Section Partitioning Tasks into Non-Preemptive Groups We have already discussed how the use of preemption thresholds eliminates unnecessary preemptability. We now use this idea to form non-preemptive groups. A nonpreemptive group consists of a set of tasks in which every pair is mutually non-preemptive. By looking at the scheduling attributes of two tasks, we can identify whether one task can preempt the other. In this way, we can form pairs of tasks that are non-preemptive with respect to each other. These tasks can then be grouped into non-preemptive groups, where a non-preemptive group consists of a set of tasks in which every pair is mutually non-preemptive. In general, there may be many ways to merge tasks into non preemptive groups. We have developed an algorithm that takes a task set, along with their scheduling attributes, and partitions the task set into a minimum number of nonpreemptive groups. Each such non-preemptive group is then used as an event-handling task in the implementation Priority Management of Event Handling Tasks Each event handling task in the implementation potentially handles many events corresponding to multiple tasks in the design model. Each such event has a priority and a preemption threshold assigned to it. We want to ensure that the implementation preserves the schedulability. In other words, the scheduling of the implementation should be consistent with the preemption threshold scheduling model if each design level task was implemented as a separate task. In the implementation, we have two levels of scheduling. Within a single task, we have events processed in a non-preemptive manner based on event priority. This nonpreemptability of event processing within an implementation task is consistent with that of the design model since they are made up of a non-preemptive group. When there are multiple implementation tasks, tasks can preempt each other based on their priorities. The priority of a task is managed as follows. When an event is generated and deposited into the event queue of a task, the task s priority is set to the maximum of its current priority, and the priority of the event. When a task picks up an event to process, the priority of the task is set to the preemption threshold of the event. At the end of the event processing, its priority is set to the highest priority pending event in its event queue. With this scheme, a task s priority is (1) maximum of all the pending events in its event queue, when it is not processing an event, and (2) the preemption threshold of the event being processed when it is processing an event. It is easy to see that this priority scheme is consistent with the preemption threshold scheduling model. 4. Case Studies To illustrate the benefits of our approach we apply it to published case studies on the benefits of real-time schedulability analysis for real-time software design. The first example represents the Attitude and Orbital Control System for the Olympus Satellite, and we use the task set given in [2]. The second example is the task set describing a generic avionics platform (GAP) given in [10].
5 4.1. Olympus Satellite The task set consists of 21 tasks, and includes both periodic and sporadic tasks, although the distinction is not important in our discussion. Since no deadlines were given, we assume that the deadline equals period for each task. The task set is presented in Table 1, and has a utilization of. The task set is schedulable under preemptive scheduling, but not under non-preemptive scheduling. This is because some of the tasks, especially task 10, have a long execution time and if not preempted will cause missed deadlines for tasks with tighter deadlines (e.g., task 1 and 13). If we scale the computation times, we find that the breakdown utilization of this task set is with preemptive scheduling, but increases to when preemption thresholds are used. To generate an implementation, we first assigned the scheduling attributes to the task set, and then fine-tuned them to minimize preemptability. The resultant assignment is also shown in Table 1. We use higher numbers to denote higher priorities. As is clear from the table, many of the tasks are assigned a preemption threshold of 21, the highest priority, thus making all those tasks non-preemptable. In fact, only 3 tasks are not assigned a threshold of 21; these tasks have large computation times and therefore must be preempted to ensure schedulability. In this way, we can see that the assignment of scheduling attributes automatically finds the necessary preempt ability within tasks. This assignment can then be used to form non-preemptive groups. This results in three groups: (a) task 10, (b) tasks 8 and 12, and (c) all other tasks. Thus, the entire system can be implemented with only 3 tasks Generic Avionics Platform The avionics task set consists of 17 tasks, and includes both periodic and sporadic tasks. Again the distinction is not important in our discussion. The deadline equals period for each task in this case. The task set is presented in Table 4.2, and has a utilization of. The task set is schedulable under both preemptive and non-preemptive scheduling. If we scale the computation times, we find that the breakdown utilization of this task set is with preemptive scheduling, and with non-preemptive scheduling. Also, there is no schedulability improvement using preemption thresholds. Task Period WCET Priority Threshold Table 1. Task Set for Olympus Satellite System We again used the same approach of reducing preemptability and then finding the tasks for implementation. For the task set above, we find that the task set is schedulable under non-preemptive scheduling with the preemption threshold set to the highest priority. Thus, the system can be implemented with only a single task. If we scale the utilization to, where it is not schedulable with nonpreemptive scheduling, we find that the system requires 3 tasks for implementation. 5. Conclusion We have described current results from our research into automatic synthesis of multi-tasking implementations from real-time design models. Our approach is based on a new scheduling model using preemption thresholds for tasks that integrates and subsumes both preemptive and non-preemptive scheduling models. As a result it provides higher schedulability than both preemptive and non-
6 Task Period WCET Priority Threshold Table 2. Task Set for Generic Avionics Platform preemptive scheduling models. Using this new scheduling model we are able to assess schedulability at design time. The assessment of schedulability includes finding a set of feasible scheduling attributes for tasks. We can then refine a set of feasible scheduling attributes to eliminate any unnecessary preemptions. To reduce run-time multi-tasking costs, we can combine several design level tasks into a single implementation task. This is done in a way that preserves the schedulability assessment at design time. Run-time multi-tasking costs are reduced by minimizing the number of implementation tasks. A fewer number of tasks in the implementation results in memory savings due to the stack space needed for each task. It also conserves CPU bandwidth due to reduced preemptions and context switches. Our ongoing research work is integrating the approach described in this paper with object-oriented design and automatic synthesis of implementations from object-oriented design models [11]. In conjunction with automatic code generation from design models [7], we believe that our approach takes a significant step towards streamlining realtime software design, and eliminating many of the ad-hoc and manual steps needed in current practice to develop a schedulable real-time system. References [1] M. Awad, J. kuusela, and J. Ziegler. Object-Oriented Technology for Real-Time Systems: A Practical Approach using OMT and Fusion. Prentice Hall, [2] C. M. Bailey, A. Burns, A. J. Wellings, and C. H. Forsyth. A performance analysis of a hard real-time system. Technical Report YCS 224, Department of Computer Science, University of York, [3] A. Burns and A. J. Wellings. HRT-HOOD: A Design Method for Hard Real-Time. Real-Time Systems, 6(1):73 114, [4] B. P. Douglass. Doing Hard Time: Developing Real-Time Systems with Objects, frameworks, and Patterns. Addison- Wesley, [5] L. George, N. Rivierre, and M. Spuri. Preemptive and nonpreemptive real-time uni-processor scheduling. Technical Report 2966, INRIA, France, sep [6] H. Gomaa. Software Design Methods for Concurrent and Real-Time Systems. Addison-Wesley Publishing Company, [7] P. Karvelas. Schedulability Analysis and Automated Implementation of Real-Time Object-Oriented Design Models. Master s thesis, Concordia University, May [8] M. H. Klein, T. Ralya, B. Pollak, R. Obenza, and M. G. Harbour. A Practitioner s Handbook for Real-Time Analysis. Kluwer Academic Publishers, [9] C. Locke. Software architecture for hard real-time applications: Cyclic executives vs. fixed priority executives. The Journal of Real-Time Systems, 4(1):37 53, Mar [10] C. Locke, D. Vogel, and T. Mesler. Building a predictable avionics platform in ada: A case study. In Proceedings of IEEE Real-Time Systems Symposium, pages IEEE Computer Society Press, Dec [11] M. Saksena, P. Karvelas, and Y. Wang. Automatic synthesis of multi-tasking implementations from real-time objectoriented models. In Proceedings, IEEE International Symposium on Object-Oriented Real-Time Distributed Computing, March [12] B. Selic, G. Gullekson, and P. T. Ward. Real-Time Object- Oriented Modeling. John Wiley and Sons, [13] S. A. Stolper. Streamlined design approach lands mars pathfinder. IEEE Software, September [14] K. Tindell, A. Burns, and A. Wellings. An extendible approach for analysing fixed priority hard real-time tasks. The Journal of Real-Time Systems, 6(2): , Mar [15] Y. Wang and M. Saksena. Fixed priority scheduling with preemption threshold. In Proceedings, IEEE International Conference on Real-Time Computing Systems and Applications, December 1999.
HARD REAL-TIME COMPUTING SYSTEMS Predictable Scheduling Algorithms and Applications
HARD REAL-TIME COMPUTING SYSTEMS Predictable Scheduling Algorithms and Applications THE KLUWER INTERNATIONAL SERIES IN ENGINEERING AND COMPUTER SCIENCE REAL-TIME SYSTEMS Consulting Editor John A. Stankovic
More informationOn the Combined Behavior of Autonomous Resource Management Agents
On the Combined Behavior of Autonomous Resource Management Agents Siri Fagernes 1 and Alva L. Couch 2 1 Faculty of Engineering Oslo University College Oslo, Norway siri.fagernes@iu.hio.no 2 Computer Science
More informationData Fusion Models in WSNs: Comparison and Analysis
Proceedings of 2014 Zone 1 Conference of the American Society for Engineering Education (ASEE Zone 1) Data Fusion s in WSNs: Comparison and Analysis Marwah M Almasri, and Khaled M Elleithy, Senior Member,
More informationDifferent Requirements Gathering Techniques and Issues. Javaria Mushtaq
835 Different Requirements Gathering Techniques and Issues Javaria Mushtaq Abstract- Project management is now becoming a very important part of our software industries. To handle projects with success
More informationSoftware Maintenance
1 What is Software Maintenance? Software Maintenance is a very broad activity that includes error corrections, enhancements of capabilities, deletion of obsolete capabilities, and optimization. 2 Categories
More informationImproving Fairness in Memory Scheduling
Improving Fairness in Memory Scheduling Using a Team of Learning Automata Aditya Kajwe and Madhu Mutyam Department of Computer Science & Engineering, Indian Institute of Tehcnology - Madras June 14, 2014
More informationThe open source development model has unique characteristics that make it in some
Is the Development Model Right for Your Organization? A roadmap to open source adoption by Ibrahim Haddad The open source development model has unique characteristics that make it in some instances a superior
More informationDesigning a Rubric to Assess the Modelling Phase of Student Design Projects in Upper Year Engineering Courses
Designing a Rubric to Assess the Modelling Phase of Student Design Projects in Upper Year Engineering Courses Thomas F.C. Woodhall Masters Candidate in Civil Engineering Queen s University at Kingston,
More informationGiven a directed graph G =(N A), where N is a set of m nodes and A. destination node, implying a direction for ow to follow. Arcs have limitations
4 Interior point algorithms for network ow problems Mauricio G.C. Resende AT&T Bell Laboratories, Murray Hill, NJ 07974-2070 USA Panos M. Pardalos The University of Florida, Gainesville, FL 32611-6595
More informationTHE DEPARTMENT OF DEFENSE HIGH LEVEL ARCHITECTURE. Richard M. Fujimoto
THE DEPARTMENT OF DEFENSE HIGH LEVEL ARCHITECTURE Judith S. Dahmann Defense Modeling and Simulation Office 1901 North Beauregard Street Alexandria, VA 22311, U.S.A. Richard M. Fujimoto College of Computing
More informationRunning Head: STUDENT CENTRIC INTEGRATED TECHNOLOGY
SCIT Model 1 Running Head: STUDENT CENTRIC INTEGRATED TECHNOLOGY Instructional Design Based on Student Centric Integrated Technology Model Robert Newbury, MS December, 2008 SCIT Model 2 Abstract The ADDIE
More informationVirtual Teams: The Design of Architecture and Coordination for Realistic Performance and Shared Awareness
Virtual Teams: The Design of Architecture and Coordination for Realistic Performance and Shared Awareness Bryan Moser, Global Project Design John Halpin, Champlain College St. Lawrence Introduction Global
More informationMalicious User Suppression for Cooperative Spectrum Sensing in Cognitive Radio Networks using Dixon s Outlier Detection Method
Malicious User Suppression for Cooperative Spectrum Sensing in Cognitive Radio Networks using Dixon s Outlier Detection Method Sanket S. Kalamkar and Adrish Banerjee Department of Electrical Engineering
More informationA Case Study: News Classification Based on Term Frequency
A Case Study: News Classification Based on Term Frequency Petr Kroha Faculty of Computer Science University of Technology 09107 Chemnitz Germany kroha@informatik.tu-chemnitz.de Ricardo Baeza-Yates Center
More informationVisual CP Representation of Knowledge
Visual CP Representation of Knowledge Heather D. Pfeiffer and Roger T. Hartley Department of Computer Science New Mexico State University Las Cruces, NM 88003-8001, USA email: hdp@cs.nmsu.edu and rth@cs.nmsu.edu
More informationGACE Computer Science Assessment Test at a Glance
GACE Computer Science Assessment Test at a Glance Updated May 2017 See the GACE Computer Science Assessment Study Companion for practice questions and preparation resources. Assessment Name Computer Science
More informationReinforcement Learning by Comparing Immediate Reward
Reinforcement Learning by Comparing Immediate Reward Punit Pandey DeepshikhaPandey Dr. Shishir Kumar Abstract This paper introduces an approach to Reinforcement Learning Algorithm by comparing their immediate
More information(Sub)Gradient Descent
(Sub)Gradient Descent CMSC 422 MARINE CARPUAT marine@cs.umd.edu Figures credit: Piyush Rai Logistics Midterm is on Thursday 3/24 during class time closed book/internet/etc, one page of notes. will include
More informationDocument number: 2013/ Programs Committee 6/2014 (July) Agenda Item 42.0 Bachelor of Engineering with Honours in Software Engineering
Document number: 2013/0006139 Programs Committee 6/2014 (July) Agenda Item 42.0 Bachelor of Engineering with Honours in Software Engineering Program Learning Outcomes Threshold Learning Outcomes for Engineering
More informationUniversity of Groningen. Systemen, planning, netwerken Bosman, Aart
University of Groningen Systemen, planning, netwerken Bosman, Aart IMPORTANT NOTE: You are advised to consult the publisher's version (publisher's PDF) if you wish to cite from it. Please check the document
More informationPESIT SOUTH CAMPUS 10CS71-OBJECT-ORIENTED MODELING AND DESIGN. Faculty: Mrs.Sumana Sinha No. Of Hours: 52. Outcomes
10CS71-OBJECT-ORIENTED MODELING AND DESIGN Faculty: Mrs.Sumana Sinha Of Hours: 52 Course Objective: The objective of this course is to enlighten students the software approach of handling large projects
More informationRover Races Grades: 3-5 Prep Time: ~45 Minutes Lesson Time: ~105 minutes
Rover Races Grades: 3-5 Prep Time: ~45 Minutes Lesson Time: ~105 minutes WHAT STUDENTS DO: Establishing Communication Procedures Following Curiosity on Mars often means roving to places with interesting
More informationIntroduction to Simulation
Introduction to Simulation Spring 2010 Dr. Louis Luangkesorn University of Pittsburgh January 19, 2010 Dr. Louis Luangkesorn ( University of Pittsburgh ) Introduction to Simulation January 19, 2010 1 /
More informationLEGO MINDSTORMS Education EV3 Coding Activities
LEGO MINDSTORMS Education EV3 Coding Activities s t e e h s k r o W t n e d Stu LEGOeducation.com/MINDSTORMS Contents ACTIVITY 1 Performing a Three Point Turn 3-6 ACTIVITY 2 Written Instructions for a
More informationINPE São José dos Campos
INPE-5479 PRE/1778 MONLINEAR ASPECTS OF DATA INTEGRATION FOR LAND COVER CLASSIFICATION IN A NEDRAL NETWORK ENVIRONNENT Maria Suelena S. Barros Valter Rodrigues INPE São José dos Campos 1993 SECRETARIA
More informationModule 12. Machine Learning. Version 2 CSE IIT, Kharagpur
Module 12 Machine Learning 12.1 Instructional Objective The students should understand the concept of learning systems Students should learn about different aspects of a learning system Students should
More informationA Pipelined Approach for Iterative Software Process Model
A Pipelined Approach for Iterative Software Process Model Ms.Prasanthi E R, Ms.Aparna Rathi, Ms.Vardhani J P, Mr.Vivek Krishna Electronics and Radar Development Establishment C V Raman Nagar, Bangalore-560093,
More informationActive Learning. Yingyu Liang Computer Sciences 760 Fall
Active Learning Yingyu Liang Computer Sciences 760 Fall 2017 http://pages.cs.wisc.edu/~yliang/cs760/ Some of the slides in these lectures have been adapted/borrowed from materials developed by Mark Craven,
More informationSeminar - Organic Computing
Seminar - Organic Computing Self-Organisation of OC-Systems Markus Franke 25.01.2006 Typeset by FoilTEX Timetable 1. Overview 2. Characteristics of SO-Systems 3. Concern with Nature 4. Design-Concepts
More informationCS Machine Learning
CS 478 - Machine Learning Projects Data Representation Basic testing and evaluation schemes CS 478 Data and Testing 1 Programming Issues l Program in any platform you want l Realize that you will be doing
More informationMathematics textbooks the link between the intended and the implemented curriculum? Monica Johansson Luleå University of Technology, Sweden
Mathematics textbooks the link between the intended and the implemented curriculum? Monica Johansson Luleå University of Technology, Sweden Textbooks are a predominant source in mathematics classrooms
More informationAn Introduction to the Minimalist Program
An Introduction to the Minimalist Program Luke Smith University of Arizona Summer 2016 Some findings of traditional syntax Human languages vary greatly, but digging deeper, they all have distinct commonalities:
More informationCREATING SHARABLE LEARNING OBJECTS FROM EXISTING DIGITAL COURSE CONTENT
CREATING SHARABLE LEARNING OBJECTS FROM EXISTING DIGITAL COURSE CONTENT Rajendra G. Singh Margaret Bernard Ross Gardler rajsingh@tstt.net.tt mbernard@fsa.uwi.tt rgardler@saafe.org Department of Mathematics
More informationA cognitive perspective on pair programming
Association for Information Systems AIS Electronic Library (AISeL) AMCIS 2006 Proceedings Americas Conference on Information Systems (AMCIS) December 2006 A cognitive perspective on pair programming Radhika
More informationA Process-Model Account of Task Interruption and Resumption: When Does Encoding of the Problem State Occur?
A Process-Model Account of Task Interruption and Resumption: When Does Encoding of the Problem State Occur? Dario D. Salvucci Drexel University Philadelphia, PA Christopher A. Monk George Mason University
More informationAdvanced Multiprocessor Programming
Advanced Multiprocessor Programming Vorbesprechung Jesper Larsson Träff, Sascha Hunold traff@par. Research Group Parallel Computing Faculty of Informatics, Institute of Information Systems Vienna University
More informationMultisensor Data Fusion: From Algorithms And Architectural Design To Applications (Devices, Circuits, And Systems)
Multisensor Data Fusion: From Algorithms And Architectural Design To Applications (Devices, Circuits, And Systems) If searching for the ebook Multisensor Data Fusion: From Algorithms and Architectural
More informationEvaluation of Usage Patterns for Web-based Educational Systems using Web Mining
Evaluation of Usage Patterns for Web-based Educational Systems using Web Mining Dave Donnellan, School of Computer Applications Dublin City University Dublin 9 Ireland daviddonnellan@eircom.net Claus Pahl
More informationEvaluation of Usage Patterns for Web-based Educational Systems using Web Mining
Evaluation of Usage Patterns for Web-based Educational Systems using Web Mining Dave Donnellan, School of Computer Applications Dublin City University Dublin 9 Ireland daviddonnellan@eircom.net Claus Pahl
More informationIt's Not Just Standing Up: Patterns for Daily Stand-up Meetings
It's Not Just Standing Up: Patterns for Daily Stand-up Meetings Jason Yip, ThoughtWorks, Inc. jcyip@thoughtworks.com Introduction The daily stand-up meeting is simple to describe: the whole team meets
More informationWHY SOLVE PROBLEMS? INTERVIEWING COLLEGE FACULTY ABOUT THE LEARNING AND TEACHING OF PROBLEM SOLVING
From Proceedings of Physics Teacher Education Beyond 2000 International Conference, Barcelona, Spain, August 27 to September 1, 2000 WHY SOLVE PROBLEMS? INTERVIEWING COLLEGE FACULTY ABOUT THE LEARNING
More informationECE-492 SENIOR ADVANCED DESIGN PROJECT
ECE-492 SENIOR ADVANCED DESIGN PROJECT Meeting #3 1 ECE-492 Meeting#3 Q1: Who is not on a team? Q2: Which students/teams still did not select a topic? 2 ENGINEERING DESIGN You have studied a great deal
More informationLearning Methods for Fuzzy Systems
Learning Methods for Fuzzy Systems Rudolf Kruse and Andreas Nürnberger Department of Computer Science, University of Magdeburg Universitätsplatz, D-396 Magdeburg, Germany Phone : +49.39.67.876, Fax : +49.39.67.8
More informationSYLLABUS Rochester Institute of Technology College of Liberal Arts, Department of Psychology Fall Quarter, 2007
SYLLABUS Rochester Institute of Technology College of Liberal Arts, Department of Psychology Fall Quarter, 2007 Course Title: Meeting Times: Instructor: Topics in Engineering Psychology: Temporal Awareness
More informationTowards a Collaboration Framework for Selection of ICT Tools
Towards a Collaboration Framework for Selection of ICT Tools Deepak Sahni, Jan Van den Bergh, and Karin Coninx Hasselt University - transnationale Universiteit Limburg Expertise Centre for Digital Media
More informationWeb as Corpus. Corpus Linguistics. Web as Corpus 1 / 1. Corpus Linguistics. Web as Corpus. web.pl 3 / 1. Sketch Engine. Corpus Linguistics
(L615) Markus Dickinson Department of Linguistics, Indiana University Spring 2013 The web provides new opportunities for gathering data Viable source of disposable corpora, built ad hoc for specific purposes
More informationThe Strong Minimalist Thesis and Bounded Optimality
The Strong Minimalist Thesis and Bounded Optimality DRAFT-IN-PROGRESS; SEND COMMENTS TO RICKL@UMICH.EDU Richard L. Lewis Department of Psychology University of Michigan 27 March 2010 1 Purpose of this
More informationLearning to Schedule Straight-Line Code
Learning to Schedule Straight-Line Code Eliot Moss, Paul Utgoff, John Cavazos Doina Precup, Darko Stefanović Dept. of Comp. Sci., Univ. of Mass. Amherst, MA 01003 Carla Brodley, David Scheeff Sch. of Elec.
More informationCal s Dinner Card Deals
Cal s Dinner Card Deals Overview: In this lesson students compare three linear functions in the context of Dinner Card Deals. Students are required to interpret a graph for each Dinner Card Deal to help
More informationA Minimalist Approach to Code-Switching. In the field of linguistics, the topic of bilingualism is a broad one. There are many
Schmidt 1 Eric Schmidt Prof. Suzanne Flynn Linguistic Study of Bilingualism December 13, 2013 A Minimalist Approach to Code-Switching In the field of linguistics, the topic of bilingualism is a broad one.
More informationISFA2008U_120 A SCHEDULING REINFORCEMENT LEARNING ALGORITHM
Proceedings of 28 ISFA 28 International Symposium on Flexible Automation Atlanta, GA, USA June 23-26, 28 ISFA28U_12 A SCHEDULING REINFORCEMENT LEARNING ALGORITHM Amit Gil, Helman Stern, Yael Edan, and
More informationLearning Optimal Dialogue Strategies: A Case Study of a Spoken Dialogue Agent for
Learning Optimal Dialogue Strategies: A Case Study of a Spoken Dialogue Agent for Email Marilyn A. Walker Jeanne C. Fromer Shrikanth Narayanan walker@research.att.com jeannie@ai.mit.edu shri@research.att.com
More informationSpecification and Evaluation of Machine Translation Toy Systems - Criteria for laboratory assignments
Specification and Evaluation of Machine Translation Toy Systems - Criteria for laboratory assignments Cristina Vertan, Walther v. Hahn University of Hamburg, Natural Language Systems Division Hamburg,
More informationCONCEPT MAPS AS A DEVICE FOR LEARNING DATABASE CONCEPTS
CONCEPT MAPS AS A DEVICE FOR LEARNING DATABASE CONCEPTS Pirjo Moen Department of Computer Science P.O. Box 68 FI-00014 University of Helsinki pirjo.moen@cs.helsinki.fi http://www.cs.helsinki.fi/pirjo.moen
More informationOn-Line Data Analytics
International Journal of Computer Applications in Engineering Sciences [VOL I, ISSUE III, SEPTEMBER 2011] [ISSN: 2231-4946] On-Line Data Analytics Yugandhar Vemulapalli #, Devarapalli Raghu *, Raja Jacob
More informationA Reinforcement Learning Variant for Control Scheduling
A Reinforcement Learning Variant for Control Scheduling Aloke Guha Honeywell Sensor and System Development Center 3660 Technology Drive Minneapolis MN 55417 Abstract We present an algorithm based on reinforcement
More informationImplementing a tool to Support KAOS-Beta Process Model Using EPF
Implementing a tool to Support KAOS-Beta Process Model Using EPF Malihe Tabatabaie Malihe.Tabatabaie@cs.york.ac.uk Department of Computer Science The University of York United Kingdom Eclipse Process Framework
More informationThe Round Earth Project. Collaborative VR for Elementary School Kids
Johnson, A., Moher, T., Ohlsson, S., The Round Earth Project - Collaborative VR for Elementary School Kids, In the SIGGRAPH 99 conference abstracts and applications, Los Angeles, California, Aug 8-13,
More informationEvaluation of Learning Management System software. Part II of LMS Evaluation
Version DRAFT 1.0 Evaluation of Learning Management System software Author: Richard Wyles Date: 1 August 2003 Part II of LMS Evaluation Open Source e-learning Environment and Community Platform Project
More informationPH.D. IN COMPUTER SCIENCE PROGRAM (POST M.S.)
PH.D. IN COMPUTER SCIENCE PROGRAM (POST M.S.) OVERVIEW ADMISSION REQUIREMENTS PROGRAM REQUIREMENTS OVERVIEW FOR THE PH.D. IN COMPUTER SCIENCE Overview The doctoral program is designed for those students
More informationProgram Assessment and Alignment
Program Assessment and Alignment Lieutenant Colonel Daniel J. McCarthy, Assistant Professor Lieutenant Colonel Michael J. Kwinn, Jr., PhD, Associate Professor Department of Systems Engineering United States
More informationProcess improvement, The Agile Way! By Ben Linders Published in Methods and Tools, winter
Process improvement, The Agile Way! By Ben Linders Published in Methods and Tools, winter 2010. http://www.methodsandtools.com/ Summary Business needs for process improvement projects are changing. Organizations
More informationBluetooth mlearning Applications for the Classroom of the Future
Bluetooth mlearning Applications for the Classroom of the Future Tracey J. Mehigan, Daniel C. Doolan, Sabin Tabirca Department of Computer Science, University College Cork, College Road, Cork, Ireland
More informationAdvanced Multiprocessor Programming
Advanced Multiprocessor Programming Vorbesprechung Jesper Larsson Träff traff@par.tuwien.ac.at Research Group Parallel Computing Faculty of Informatics, Institute of Information Systems Vienna University
More informationThe Use of Statistical, Computational and Modelling Tools in Higher Learning Institutions: A Case Study of the University of Dodoma
International Journal of Computer Applications (975 8887) The Use of Statistical, Computational and Modelling Tools in Higher Learning Institutions: A Case Study of the University of Dodoma Gilbert M.
More informationCLASSROOM MANAGEMENT INTRODUCTION
CLASSROOM MANAGEMENT Dr. Jasmina Delceva Dizdarevik, Institute of Pedagogy, Faculty of Philosophy Ss. Cyril and Methodius University-Skopje, Macedonia E-mail : jdelceva@yahoo.com Received: February, 20.2014.
More informationEECS 571 PRINCIPLES OF REAL-TIME COMPUTING Fall 10. Instructor: Kang G. Shin, 4605 CSE, ;
EECS 571 PRINCIPLES OF REAL-TIME COMPUTING Fall 10 Instructor: Kang G. Shin, 4605 CSE, 763-0391; kgshin@umich.edu Number of credit hours: 4 Class meeting time and room: Regular classes: MW 10:30am noon
More informationP. Belsis, C. Sgouropoulou, K. Sfikas, G. Pantziou, C. Skourlas, J. Varnas
Exploiting Distance Learning Methods and Multimediaenhanced instructional content to support IT Curricula in Greek Technological Educational Institutes P. Belsis, C. Sgouropoulou, K. Sfikas, G. Pantziou,
More informationEducation: Integrating Parallel and Distributed Computing in Computer Science Curricula
IEEE DISTRIBUTED SYSTEMS ONLINE 1541-4922 2006 Published by the IEEE Computer Society Vol. 7, No. 2; February 2006 Education: Integrating Parallel and Distributed Computing in Computer Science Curricula
More informationA Note on Structuring Employability Skills for Accounting Students
A Note on Structuring Employability Skills for Accounting Students Jon Warwick and Anna Howard School of Business, London South Bank University Correspondence Address Jon Warwick, School of Business, London
More informationA Neural Network GUI Tested on Text-To-Phoneme Mapping
A Neural Network GUI Tested on Text-To-Phoneme Mapping MAARTEN TROMPPER Universiteit Utrecht m.f.a.trompper@students.uu.nl Abstract Text-to-phoneme (T2P) mapping is a necessary step in any speech synthesis
More informationValue Creation Through! Integration Workshop! Value Stream Analysis and Mapping for PD! January 31, 2002!
Presented by:! Hugh McManus for Rich Millard! MIT! Value Creation Through! Integration Workshop! Value Stream Analysis and Mapping for PD!!!! January 31, 2002! Steps in Lean Thinking (Womack and Jones)!
More informationAgent-Based Software Engineering
Agent-Based Software Engineering Learning Guide Information for Students 1. Description Grade Module Máster Universitario en Ingeniería de Software - European Master on Software Engineering Advanced Software
More informationCognitive Modeling. Tower of Hanoi: Description. Tower of Hanoi: The Task. Lecture 5: Models of Problem Solving. Frank Keller.
Cognitive Modeling Lecture 5: Models of Problem Solving Frank Keller School of Informatics University of Edinburgh keller@inf.ed.ac.uk January 22, 2008 1 2 3 4 Reading: Cooper (2002:Ch. 4). Frank Keller
More informationA Coding System for Dynamic Topic Analysis: A Computer-Mediated Discourse Analysis Technique
A Coding System for Dynamic Topic Analysis: A Computer-Mediated Discourse Analysis Technique Hiromi Ishizaki 1, Susan C. Herring 2, Yasuhiro Takishima 1 1 KDDI R&D Laboratories, Inc. 2 Indiana University
More informationCommittee on Academic Policy and Issues (CAPI) Marquette University. Annual Report, Academic Year
Committee Description: Committee on Academic Policy and Issues (CAPI) Marquette University Annual Report, Academic Year 2013-2014 The Committee on Academic Policies and Issues (CAPI) pursues long-range
More informationMajor Milestones, Team Activities, and Individual Deliverables
Major Milestones, Team Activities, and Individual Deliverables Milestone #1: Team Semester Proposal Your team should write a proposal that describes project objectives, existing relevant technology, engineering
More informationEmbedded System Design 2.0: Rationale Behind a Textbook Revision
Embedded System Design 2.0: Rationale Behind a Textbook Revision Peter Marwedel TU Dortmund, Informatik 12 Dortmund, Germany Michael Engel TU Dortmund, Informatik 12 Dortmund, Germany ABSTRACT Seven years
More informationObserving Teachers: The Mathematics Pedagogy of Quebec Francophone and Anglophone Teachers
Observing Teachers: The Mathematics Pedagogy of Quebec Francophone and Anglophone Teachers Dominic Manuel, McGill University, Canada Annie Savard, McGill University, Canada David Reid, Acadia University,
More informationPAST EXPERIENCE AS COORDINATION ENABLER IN EXTREME ENVIRONMENT: THE CASE OF THE FRENCH AIR FORCE AEROBATIC TEAM
PAST EXPERIENCE AS COORDINATION ENABLER IN EXTREME ENVIRONMENT: THE CASE OF THE FRENCH AIR FORCE AEROBATIC TEAM Cécile Godé Responsable de l équipe de management des organisations de Défense (EMOD) Chercheur
More informationProFusion2 Sensor Data Fusion for Multiple Active Safety Applications
ProFusion2 Sensor Data Fusion for Multiple Active Safety Applications S.-B. Park 1, F. Tango 2, O. Aycard 3, A. Polychronopoulos 4, U. Scheunert 5, T. Tatschke 6 1 DELPHI, Electronics & Safety, 42119 Wuppertal,
More informationEverton Library, Liverpool: Market assessment and project viability study 1
Everton Library, Liverpool: Market assessment and project viability study 1 Chapter 1: Executive summary Introduction 1.1 This executive summary provides a précis of a Phase 3 Market Assessment and Project
More informationFragment Analysis and Test Case Generation using F- Measure for Adaptive Random Testing and Partitioned Block based Adaptive Random Testing
Fragment Analysis and Test Case Generation using F- Measure for Adaptive Random Testing and Partitioned Block based Adaptive Random Testing D. Indhumathi Research Scholar Department of Information Technology
More informationBy Merrill Harmin, Ph.D.
Inspiring DESCA: A New Context for Active Learning By Merrill Harmin, Ph.D. The key issue facing today s teachers is clear: Compared to years past, fewer students show up ready for responsible, diligent
More informationThe Role of Architecture in a Scaled Agile Organization - A Case Study in the Insurance Industry
Master s Thesis for the Attainment of the Degree Master of Science at the TUM School of Management of the Technische Universität München The Role of Architecture in a Scaled Agile Organization - A Case
More informationEarly Warning System Implementation Guide
Linking Research and Resources for Better High Schools betterhighschools.org September 2010 Early Warning System Implementation Guide For use with the National High School Center s Early Warning System
More informationBluetooth mlearning Applications for the Classroom of the Future
Bluetooth mlearning Applications for the Classroom of the Future Tracey J. Mehigan Daniel C. Doolan Sabin Tabirca University College Cork, Ireland 2007 Overview Overview Introduction Mobile Learning Bluetooth
More informationConcept Formation Learning Plan
2007WM Concept Formation Learning Plan Social Contract Racquel Parra [Pick the date] [Type the abstract of the document here. The abstract is typically a short summary of the contents of the document.
More informationInstitutionen för datavetenskap. Hardware test equipment utilization measurement
Institutionen för datavetenskap Department of Computer and Information Science Final thesis Hardware test equipment utilization measurement by Denis Golubovic, Niklas Nieminen LIU-IDA/LITH-EX-A 15/030
More informationA Context-Driven Use Case Creation Process for Specifying Automotive Driver Assistance Systems
A Context-Driven Use Case Creation Process for Specifying Automotive Driver Assistance Systems Hannes Omasreiter, Eduard Metzker DaimlerChrysler AG Research Information and Communication Postfach 23 60
More informationData Integration through Clustering and Finding Statistical Relations - Validation of Approach
Data Integration through Clustering and Finding Statistical Relations - Validation of Approach Marek Jaszuk, Teresa Mroczek, and Barbara Fryc University of Information Technology and Management, ul. Sucharskiego
More informationEvolutive Neural Net Fuzzy Filtering: Basic Description
Journal of Intelligent Learning Systems and Applications, 2010, 2: 12-18 doi:10.4236/jilsa.2010.21002 Published Online February 2010 (http://www.scirp.org/journal/jilsa) Evolutive Neural Net Fuzzy Filtering:
More informationMastering Team Skills and Interpersonal Communication. Copyright 2012 Pearson Education, Inc. publishing as Prentice Hall.
Chapter 2 Mastering Team Skills and Interpersonal Communication Chapter 2-1 Communicating Effectively in Teams Chapter 2-2 Communicating Effectively in Teams Collaboration involves working together to
More informationWhat s in a Step? Toward General, Abstract Representations of Tutoring System Log Data
What s in a Step? Toward General, Abstract Representations of Tutoring System Log Data Kurt VanLehn 1, Kenneth R. Koedinger 2, Alida Skogsholm 2, Adaeze Nwaigwe 2, Robert G.M. Hausmann 1, Anders Weinstein
More informationA GENERIC SPLIT PROCESS MODEL FOR ASSET MANAGEMENT DECISION-MAKING
A GENERIC SPLIT PROCESS MODEL FOR ASSET MANAGEMENT DECISION-MAKING Yong Sun, a * Colin Fidge b and Lin Ma a a CRC for Integrated Engineering Asset Management, School of Engineering Systems, Queensland
More informationENEE 302h: Digital Electronics, Fall 2005 Prof. Bruce Jacob
Course Syllabus ENEE 302h: Digital Electronics, Fall 2005 Prof. Bruce Jacob 1. Basic Information Time & Place Lecture: TuTh 2:00 3:15 pm, CSIC-3118 Discussion Section: Mon 12:00 12:50pm, EGR-1104 Professor
More informationTeaching Algorithm Development Skills
International Journal of Advanced Computer Science, Vol. 3, No. 9, Pp. 466-474, Sep., 2013. Teaching Algorithm Development Skills Jungsoon Yoo, Sung Yoo, Suk Seo, Zhijiang Dong, & Chrisila Pettey Manuscript
More informationUsing Virtual Manipulatives to Support Teaching and Learning Mathematics
Using Virtual Manipulatives to Support Teaching and Learning Mathematics Joel Duffin Abstract The National Library of Virtual Manipulatives (NLVM) is a free website containing over 110 interactive online
More informationCooking Matters at the Store Evaluation: Executive Summary
Cooking Matters at the Store Evaluation: Executive Summary Introduction Share Our Strength is a national nonprofit with the goal of ending childhood hunger in America by connecting children with the nutritious
More informationTOKEN-BASED APPROACH FOR SCALABLE TEAM COORDINATION. by Yang Xu PhD of Information Sciences
TOKEN-BASED APPROACH FOR SCALABLE TEAM COORDINATION by Yang Xu PhD of Information Sciences Submitted to the Graduate Faculty of in partial fulfillment of the requirements for the degree of Doctor of Philosophy
More information