1 Service Scheduler in a Trustworthy Web Server Yinong Chen.

Slides:



Advertisements
Similar presentations
Vassal: Loadable Scheduler Support for Multi-Policy Scheduling George M. Candea, Oracle Corporation Michael B. Jones, Microsoft Research.
Advertisements

Processes and Threads Chapter 3 and 4 Operating Systems: Internals and Design Principles, 6/E William Stallings Patricia Roy Manatee Community College,
CMPT 431 Dr. Alexandra Fedorova Lecture III: OS Support.
CMPT 401 Summer 2007 Dr. Alexandra Fedorova Lecture III: OS Support.
CMPT 401 Dr. Alexandra Fedorova Lecture III: OS Support.
SCHEDULING Kshama Desai Bijal Shah Kishore Putta Kashyap Sheth.
Chapter 5 – Fixed-Priority Servers Typical Real-Time systems are hybrids characterized by: periodic tasks that execute critical control activities aperiodic.
1 Overview Assignment 10: hints  Deadlocks & Scheduling Assignment 9: solution  Scheduling.
Avishai Wool lecture Priority Scheduling Idea: Jobs are assigned priorities. Always, the job with the highest priority runs. Note: All scheduling.
Introduction to Operating Systems – Windows process and thread management In this lecture we will cover Threads and processes in Windows Thread priority.
Review: Process Communication Sequential Communication –Result of P1 becomes at termination the input to P2 –Tools: Redirect (>,>>) and Pipe (|) Concurrent.
Fixed-Priority Servers
Ceng Operating Systems Chapter 2.1 : Processes Process concept Process scheduling Interprocess communication Deadlocks Threads.
1 Prototype Design of an Evolutionary Trustworthy Web Server  Hons Project Fall 2003.
1 Chapter 4 Threads Threads: Resource ownership and execution.
Reliable Service Scheduler in a Distributed Web Service Environment John Bouchard Brad Tiffany Ethan Towne Daniel Richard.
Threads. Processes and Threads  Two characteristics of “processes” as considered so far: Unit of resource allocation Unit of dispatch  Characteristics.
Preemptive Scheduling Vivek Pai / Kai Li Princeton University.
U NIVERSITY OF M ASSACHUSETTS, A MHERST – Department of Computer Science Resource containers: A new facility for resource management in server systems.
Fundamentals of Python: From First Programs Through Data Structures
Tuxedo Advisor.  The Tuxedo advisor contains the following  Tuxedo Performance Advisor  Tuxedo Runtime Monitor  Tuxedo Runtime Action  Tuxedo Configuration.
Cloud Computing Systems Lin Gu Hong Kong University of Science and Technology Sept. 21, 2011 Windows Azure—Overview.
Budapesti Műszaki és Gazdaságtudományi Egyetem Méréstechnika és Információs Rendszerek Tanszék Scheduling in Windows Zoltan Micskei
Process Description and Control. Process concepts n Definitions – replaces task, job – program in execution – entity that can be assigned to and executed.
Chapter 1 Dynamic Web Page Design Y. Chen, Ph.D. ::.NET Introduction ::
1 Dr. Markus Hillenbrand, ICSY Lab, University of Kaiserslautern, Germany A Generic Database Web Service for the Venice Service Grid Michael Koch, Markus.
Processes and Threads.
Chapter 4 Processor Management
Advanced Operating Systems CIS 720 Lecture 1. Instructor Dr. Gurdip Singh – 234 Nichols Hall –
VIVO Multi-site search Structure and function overview.
1 CS 501 Spring 2003 CS 501: Software Engineering Lecture 16 System Architecture and Design II.
Threads Many software packages are multi-threaded Web browser: one thread display images, another thread retrieves data from the network Word processor:
Multi-Threaded Application CSNB534 Asma Shakil. Overview Software applications employ a strategy called multi- threaded programming to split tasks into.
Distributed Data Mining System in Java Group Member D 王春笙 D 林俊甫 D 王慧芬.
Can we use the XROOTD infrastructure in the PROOF context ? The need and functionality of a PROOF Master coordinator has been discussed during the meeting.
TabiCan: Massive Multi- Agent System Reference: Architecture and Performance Evaluation of a Massive Multi-Agent System, G. Yamamoto and Y. Nakamura, Autonomous.
Evaluation of Agent Teamwork High Performance Distributed Computing Middleware. Solomon Lane Agent Teamwork Research Assistant October 2006 – March 2007.
1 Chapter 2.1 : Processes Process concept Process concept Process scheduling Process scheduling Interprocess communication Interprocess communication Threads.
Mid Term review CSC345.
Design and Implementation of PARK (PARallel Kernel for data fitting) Paul KIENZLE, Wenwu CHEN and Ziwen FU Reflectometry Group.
Final Class Diagram for C++ Implementation Clickermatic Software Clicker.
Concurrency & Context Switching Process Control Block What's in it and why? How is it used? Who sees it? 5 State Process Model State Labels. Causes of.
ECE291 Computer Engineering II Lecture 15 Dr. Zbigniew Kalbarczyk University of Illinois at Urbana- Champaign.
CSCI 444 / CIS 644 Event Driven Programming. Outline I.What is an event driven system? II.What is event driven programming? III.Course Overview.
1/9/ :46 1 Priority Model Real-time class Idle Above Normal Normal Below Normal Lowest Highest 31 Time-critical Dynamic classes.
Threads-Process Interaction. CONTENTS  Threads  Process interaction.
1 Mouse Events See Figure See Example in Figure 11.28,
03/03/051 Performance Engineering of Software and Distributed Systems Research Activities at IIT Bombay Varsha Apte March 3 rd, 2005.
Lecture Topics: 11/15 CPU scheduling: –Scheduling goals and algorithms.
Multithreading The objectives of this chapter are: To understand the purpose of multithreading To describe Java's multithreading mechanism.
Capsule Placement in the Service Platform Bhuvan Urgaonkar Timothy Roscoe Systems Group, Sprint ATL.
CPU Scheduling Operating Systems CS 550. Last Time Deadlock Detection and Recovery Methods to handle deadlock – Ignore it! – Detect and Recover – Avoidance.
Distributed Server Scheduler Eyal Serero Alex Fishgate Supervisor : Vitaly Suchin.
Copyright © Genetic Computer School 2008 Computer Systems Architecture SA 9- 0 Lesson 9 Process Management.
Advanced Operating Systems CIS 720
Software Research Laboratory Computer Science & Engineering Department
Uniprocessor Scheduling
Chapter 2 Processes and Threads Today 2.1 Processes 2.2 Threads
Chapter 6: CPU Scheduling
Concurrency: Threads, Address Spaces, and Processes
Go4 CHEP 2001 Multithreaded Inter-Task Communication with ROOT -
Apollo Weize Sun Feb.17th, 2017.
Lecture 21: Introduction to Process Scheduling
TDC 311 Process Scheduling.
EE 472 – Embedded Systems Dr. Shwetak Patel.
Prof. Leonardo Mostarda University of Camerino
Processes and operating systems
Lecture 21: Introduction to Process Scheduling
CS703 – Advanced Operating Systems
Challenges in Implementing Software Architectures
Presentation transcript:

1 Service Scheduler in a Trustworthy Web Server Yinong Chen

2 Assumptions Use off-the-shelf client software Use.Net framework.Net framework cannot be modified Not use off-the-shelf web server, e.g. MS IIS (Internet Information Service) We will write a simple server software We will write simple service agents

3 Implementation Overview Clients off-the-shelf Service Provider Agents Service Agents Service Scheduler C# Multithreading in.Net Framework Web Server

4 Service Scheduler Distributor Priority queues S1S3S2S4 requests from Service Provider Q S1 Q S2 Q S3 Q S2 Service Scheduler.Net Runtime Dispatcher (service activator)

5 What Can Be Scheduled Service Scheduling  Which service agent should be activated?  Will be implemented in the prototype Task Scheduling  Which process (all tasks and agents in the system) should be executed?  Should be implemented in the infrastructure (OS)  Will not be implemented in the prototype

6 Implementation Consideration Each task, agent, or object is a C# thread Threads are organized in a hierarchy The main() will activate two threads:  Service Provider, which will activate: service agents  Scheduler, which will activate distributor priority queue agents dispatcher, which will activate the selected service agent

7 Dispatch Policies Select the most critical service first; Dispatch the request with the highest priority; Each service agent will start a quantum timer at the beginning. When timeout, the current process is saved, put back into its queue, and another request is dispatched