bs.c ss.c wifire_bs_comm.h/c wifire_ss_comm.h/c
|
|
- Nathan Berry
- 6 years ago
- Views:
Transcription
1 Functionality and Implementation: Note: Below boxes specify the modules/methods which are implemented by Sameer n Shravan. First line indicate file name. The BLUE colored method/file indicates which we can push directly into the kernel, but some of them may need changes. We can delete RED colored method/file(s) directly. bs.c static void signal_handler(int signo); void thread_handler(void *v); int main(void); ss.c static void signal_handler(int signo); int main(int argc, char *argv); wifire_bs_comm.h/c unsigned int get_no_of_st(void); void * recvpacket(int, unsigned char *); unsigned int wifire_setalarm(unsigned int, unsigned int); void doit_bs(); unsigned char getpackettype(wifire_mac_pdu *); char getindex(int); void getnextfreest(void); wifire_ss_comm.h/c void * recvpacket(int, unsigned char *); qinchar * selfslotintervals(wifire_beacon_message *); void doit_ss(); unsigned char getpackettype(wifire_mac_pdu *); unsigned int wifire_setalarm(unsigned int, unsigned int);
2 wifire_fdrep.h/c void showtill(void); void nextfreefd(void); void delfd(int); void wifire_broadcast_beacon(void *); wifire_construct_beacon.h unsigned char isrngslot(void); wifire_beacon_message * getbeacon(void); int get_dlmap_schedule(dlmap *); int get_ulmap_schedule(ulmap *); unsigned int getnextst(int); wifire_generate_macmgt_pkt.h/c wifire_mac_pdu* wifire_create_rng_req(void); wifire_mac_pdu* wifire_create_rng_rsp(void); wifire_mac_pdu* wifire_create_reg_req(void); wifire_mac_pdu* wifire_create_reg_rsp(void); wifire_mac_pdu* wifire_create_dsa_req(void); wifire_mac_pdu* wifire_create_dsa_rsp(void); wifire_mac_pdu* wifire_create_dsc_req(void); wifire_mac_pdu* wifire_create_dsc_rsp(void); wifire_mac_pdu* wifire_create_dsd_req(void); wifire_mac_pdu* wifire_create_dsd_rsp(void); wifire_mac_pdu* wifire_create_data_pkt(void); wifire_mac_pdu* wifire_create_syn_pkt(void); wifire_stinfo.h unsigned char getstid(char *);
3 wifire_bs_comm.h/c: All the modules which are required by BS are defined. Replace all fd with corresponding B/P/CID. unsigned int get_no_of_st(void): Returns number of ST s present in the particular BS. At present we are counting no of fd (file descriptor) present in the particular BS. In general count depend on the no of PCID. void * recvpacket(int, unsigned char *): Returns packet which received from defined 'fd' or NULL if received none. Type is set to 1 for beacon and 2 for Generic MAC PDU. If it is type 2 then it identifies what kind of packet it is(reg_req, RNG_REQ etc). What about if DAT_PKT is received? unsigned int wifire_setalarm(unsigned int sec, unsigned int intv): Generates SIGALRM signal after 'sec' seconds is elapsed. void doit_bs(); : will take care of transfer and receiving of packets to/from ST /BS in particular slot(s) based on DLMAP n ULMAP which are defined by the scheduler(round Ribin) unsigned char getpackettype(wifire_mac_pdu *); : returns type of packet by looking into the header field of the given mpdu. char getindex(int st); :it returns stid (fdid). In regular case it is PCID. void getnextfreest(void): wifire_ss_comm.h/c : All the modules which are required by ST are defined. Replace all fd with corresponding B/P/CID. void * recvpacket(int, unsigned char *); : same as revpacket() in bs_comm, received packet is copy to buffer. What about the sendpacket() module? Is it necessary or not? qinchar * selfslotintervals(wifire_beacon_message *); : read ULMAP n DLMAP, identifies slots allocated for respective ST and store timing difference b/w each slot in a linked list. void doit_ss(); : Function which get executed when SIGALARM signal is captured means when packet received. Read/send packet in respective Downlink/Uplink mode. Also taken care of beacons. unsigned char getpackettype(wifire_mac_pdu *); : returns type of packet by looking into the header field of the given mpdu. unsigned int wifire_setalarm(unsigned int, unsigned int); : generates SIGALRM signal after 'sec' seconds is elapsed.
4 wifire_generate_macmgt_pkt.h/c : wifire_mac_pdu* wifire_create_xxx_yyy(void); : create xxx_yyy management packet. Where xxx ={rng, reg, dsa, dsc, dsd, data, syn} and yyy={rsp, req}. wifire_construct_beacon.h unsigned char isrngslot(void); : Not yet defined. wifire_beacon_message * getbeacon(void); : construct a beacon which includes header, dlmap and ulmap schedule. int get_dlmap_schedule(dlmap *); : Scheduling has to be done here(at present one slot per ST is allocating) for downlink. Need changes for allocating variable number of slots per ST. int get_ulmap_schedule(ulmap *); : Scheduling has to be done here(at present one slot per ST is allocating) for uplink. Need changes for allocating variable number of slots per ST. unsigned int getnextst(int); : now it is based on fd, we have to change it based on CID. wifire_stinfo.h unsigned char getstid(char *); : returns stid when ST is switched on. In main scenario it will be MAC address. wifire_fdrep.h/c : for handling fd(s). void showtill(void); void nextfreefd(void); void delfd(int); void wifire_broadcast_beacon(void *);?????????????????????????????????????? ss.c static void signal_handler(int signo); : wait for SIGALRM, if received then call doit_ss().
5 int main(int argc, char *argv); : If ST powers on then this function get the stid then listen for beacons(signal SIGALRM or receive packet????) else listen for non beacon packet. What action should take if the received packet is not a beacon is not yet defined. bs.c static void signal_handler(int signo); : wait for SIGALRM, if received then call doit_bs(). void thread_handler(void *v); : thread related stuff (create, delete). Need changes wrt CID. Assigning the B/P/CID for particular connection goes here. int main(void); :
Implementation of WiFiRe MAC protocol
Implementation of WiFiRe MAC protocol M.Tech Project defense Ranjith Kumar Madalapu (05329R08) Under the guidance of Prof. Sridhar Iyer and Prof. Anirudha Sahoo Department of Computer Science IIT Bombay
More informationPerformance Evaluation of WiFiRe using OPNET
Performance Evaluation of WiFiRe using OPNET Under the guidance of: Prof. Sridhar Iyer and Prof. Varsha Apte Dept. of CSE (KReSIT) July 16, 2007 Goal Goal Building. Finding minimum slot length to support
More informationWimax protocol Synchronization and Initial Ranging with Real Time Developer Studio
Wimax protocol Synchronization and Initial Ranging with Real Time Developer Studio Internship 2014 ANDRES Elie ESIEE Paris Table of Contents Introduction...3 Synchronization...4 Process Base Station...4
More informationDesign and Implementation of MAC Layer of WiFiRe protocol
Design and Implementation of MAC Layer of WiFiRe protocol Under the guidance of: Prof. Sridhar Iyer and Prof. Anirudha Sahoo Kanwal Rekhi School of Information Technology July 16, 2007 Introduction Problem
More informationCS 326 Operating Systems C Programming. Greg Benson Department of Computer Science University of San Francisco
CS 326 Operating Systems C Programming Greg Benson Department of Computer Science University of San Francisco Why C? Fast (good optimizing compilers) Not too high-level (Java, Python, Lisp) Not too low-level
More informationReading Assignment 4. n Chapter 4 Threads, due 2/7. 1/31/13 CSE325 - Processes 1
Reading Assignment 4 Chapter 4 Threads, due 2/7 1/31/13 CSE325 - Processes 1 What s Next? 1. Process Concept 2. Process Manager Responsibilities 3. Operations on Processes 4. Process Scheduling 5. Cooperating
More informationCS 3305 Intro to Threads. Lecture 6
CS 3305 Intro to Threads Lecture 6 Introduction Multiple applications run concurrently! This means that there are multiple processes running on a computer Introduction Applications often need to perform
More informationEL2310 Scientific Programming
Lecture 11: Memory, Files and Bitoperations (yaseminb@kth.se) Overview Overview Lecture 11: Memory, Files and Bit operations Main function; reading and writing Bitwise Operations Lecture 11: Memory, Files
More informationCommon Misunderstandings from Exam 1 Material
Common Misunderstandings from Exam 1 Material Kyle Dewey Stack and Heap Allocation with Pointers char c = c ; char* p1 = malloc(sizeof(char)); char** p2 = &p1; Where is c allocated? Where is p1 itself
More informationCS 33. Architecture and the OS. CS33 Intro to Computer Systems XIX 1 Copyright 2017 Thomas W. Doeppner. All rights reserved.
CS 33 Architecture and the OS CS33 Intro to Computer Systems XIX 1 Copyright 2017 Thomas W. Doeppner. All rights reserved. The Operating System My Program Mary s Program Bob s Program OS CS33 Intro to
More informationCS 378: Computer Game Technology
CS 378: Computer Game Technology SDL_net Client-Server Example Spring 2012 University of Texas at Austin CS 378 Game Technology Don Fussell SDL_net TCP Chat Server if ( SDL_Init(0) < 0 ) { fprintf(stderr,
More informationConcurrency. Stefan D. Bruda. Winter 2018
Concurrency Stefan D. Bruda Winter 2018 DOING MORE THINGS SIMULTANEOUSLY Concurrency can be achieved by multiprocessing and time-sharing Best definition for concurrency: apparently simultaneous execution
More informationPrepared by Prof. Hui Jiang Process. Prof. Hui Jiang Dept of Electrical Engineering and Computer Science, York University
EECS3221.3 Operating System Fundamentals No.2 Process Prof. Hui Jiang Dept of Electrical Engineering and Computer Science, York University How OS manages CPU usage? How CPU is used? Users use CPU to run
More informationProcess. Prepared by Prof. Hui Jiang Dept. of EECS, York Univ. 1. Process in Memory (I) PROCESS. Process. How OS manages CPU usage? No.
EECS3221.3 Operating System Fundamentals No.2 Prof. Hui Jiang Dept of Electrical Engineering and Computer Science, York University How OS manages CPU usage? How CPU is used? Users use CPU to run programs
More informationProtocol Implementation Conformance Statement for IEEE Standard
00-0- IEEE C..-0/0 Protocol Implementation Conformance Statement for IEEE Standard 0.-00 00-0- WiMAX PICS v... 0 Contents Foreword... Introduction.... Scope.... References.... Definitions and Abbreviations....
More informationCS 61C: Great Ideas in Computer Architecture. Lecture 3: Pointers. Bernhard Boser & Randy Katz
CS 61C: Great Ideas in Computer Architecture Lecture 3: Pointers Bernhard Boser & Randy Katz http://inst.eecs.berkeley.edu/~cs61c Agenda Pointers in C Arrays in C This is not on the test Pointer arithmetic
More informationCall The Project Dynamic-Memory
1 2 2 Call The Project Dynamic-Memory 4 4 Copy-Paste Main # include "Utilities.hpp" int main(int argc, char * argv[]) { short int *PtrNo; (*PtrNo) = 5; printf ("(*PtrNo) = %d\n", (*PtrNo)); } getchar();
More informationUNIVERSITY OF TORONTO SCARBOROUGH Computer and Mathematical Sciences. APRIL 2016 EXAMINATIONS CSCB09H3S Software Tools & Systems Programming
UNIVERSITY OF TORONTO SCARBOROUGH Computer and Mathematical Sciences APRIL 2016 EXAMINATIONS CSCB09H3S Software Tools & Systems Programming Instructor: Bianca Schroeder and Naureen Nizam Duration: 3 hours
More informationSignal Example 1. Signal Example 2
Signal Example 1 #include #include void ctrl_c_handler(int tmp) { printf("you typed CTL-C, but I don't want to die!\n"); int main(int argc, char* argv[]) { long i; signal(sigint, ctrl_c_handler);
More informationDYNAMIC ARRAYS; FUNCTIONS & POINTERS; SHALLOW VS DEEP COPY
DYNAMIC ARRAYS; FUNCTIONS & POINTERS; SHALLOW VS DEEP COPY Pages 800 to 809 Anna Rakitianskaia, University of Pretoria STATIC ARRAYS So far, we have only used static arrays The size of a static array must
More informationComputer Systems Assignment 2: Fork and Threads Package
Autumn Term 2018 Distributed Computing Computer Systems Assignment 2: Fork and Threads Package Assigned on: October 5, 2018 Due by: October 12, 2018 1 Understanding fork() and exec() Creating new processes
More information10. I/O System Library
10. I/O System Library Header File #include // Found in C:\Nburn\include General File Descriptor Functions close --- Close open file descriptors read --- Read data from a file descriptor ReadWithTimeout
More informationCSE 1320 INTERMEDIATE PROGRAMMING - OVERVIEW AND DATA TYPES
CSE 1320 INTERMEDIATE PROGRAMMING - OVERVIEW AND DATA TYPES Mingon Kang The University of Texas at Arlington C History ANSI C, also known C89(ANSI X3.159-1989) and C90 (ISO/IEC 9899:1990) ANSI: American
More informationPerformance Evaluation of WiFiRe using OPNET
Performance Evaluation of WiFiRe using OPNET Dissertation submitted in partial fulfillment of the requirements for the degree of Master of Technology by Venkat Reddy (Roll no. 05329038) M under the guidance
More informationThread Fundamentals. CSCI 315 Operating Systems Design 1
Thread Fundamentals Notice: This set of slides is based on the notes by Professor Perrone of Bucknell and the textbook authors Silberschatz, Galvin, and Gagne, as well as the tutorial by Blaise Barney
More informationFile IO and command line input CSE 2451
File IO and command line input CSE 2451 File functions Open/Close files fopen() open a stream for a file fclose() closes a stream One character at a time: fgetc() similar to getchar() fputc() similar to
More informationIEEE Broadband Wireless Access Working Group <http://ieee802.org/16>
Project Title Date Submitted IEEE 802.16 Broadband Wireless Access Working Group A new method to enhance the network entry and re-entry procedures in PMP mode 2004-11-02 Source(s)
More informationCSE 333 SECTION 3. POSIX I/O Functions
CSE 333 SECTION 3 POSIX I/O Functions Administrivia Questions (?) HW1 Due Tonight Exercise 7 due Monday (out later today) POSIX Portable Operating System Interface Family of standards specified by the
More informationIC221: Systems Programming 12-Week Written Exam [SOLUTIONS]
IC221: Systems Programming 12-Week Written Exam [SOLUTIONS] April 2, 2014 Answer the questions in the spaces provided on the question sheets. If you run out of room for an answer, continue on the back
More informationImplementation of WiFiRe MAC protocol
Implementation of WiFiRe MAC protocol Ranging, Registration and Packet classifier modules A thesis submitted in partial fulfillment of the requirements for the degree of Master of Technology by Madalapu
More informationWeek 2 Intro to the Shell with Fork, Exec, Wait. Sarah Diesburg Operating Systems CS 3430
Week 2 Intro to the Shell with Fork, Exec, Wait Sarah Diesburg Operating Systems CS 3430 1 Why is the Shell Important? Shells provide us with a way to interact with the core system Executes programs on
More informationEmbedded Driving Me Nuts: Writing a Real Driver In User Space
Embedded Driving Me Nuts: Writing a Real Driver In User Space Now you can control USB hardware without touching the kernel and even make your driver run on BSD-based OSes with no code changes. by Greg
More informationCS 33. Architecture and the OS. CS33 Intro to Computer Systems XIX 1 Copyright 2018 Thomas W. Doeppner. All rights reserved.
CS 33 Architecture and the OS CS33 Intro to Computer Systems XIX 1 Copyright 2018 Thomas W. Doeppner. All rights reserved. The Operating System My Program Mary s Program Bob s Program OS CS33 Intro to
More informationRepresentation of image data
Representation of image data Images (e.g. digital photos) consist of a rectanglular array of discrete picture elements called pixels. An image consisting of 200 pixels rows of 300 pixels per row contains
More informationArray Initialization
Array Initialization Array declarations can specify initializations for the elements of the array: int primes[10] = { 2, 3, 5, 7, 11, 13, 17, 19, 23, 29 ; initializes primes[0] to 2, primes[1] to 3, primes[2]
More informationCohabitation between the encoding functions of Protomatics and the modeling tool of Pragmadev
Cohabitation between the encoding functions of Protomatics and the modeling tool of Pragmadev Internship 2014 ANDRES Elie ESIEE Paris Table of Contents C code under RTDS...11 The needed files...11 Description
More informationImplementation of WiFiRe MAC protocol
Implementation of WiFiRe MAC protocol Ranging, Registration and Packet classifier modules A thesis submitted in partial fulfillment of the requirements for the degree of Master of Technology by Madalapu
More informationSection 2: Processes
September 7, 2016 Contents 1 Warmup 2 1.1 Hello World............................................ 2 2 Vocabulary 2 3 Problems 3 3.1 Forks................................................ 3 3.2 Stack Allocation.........................................
More informationExceptions. CS162: Introduction to Computer Science II. Exceptions. Exceptions. Exceptions. Exceptions. Exceptions
CS162: Introduction to Computer Science II A typical way to handle error conditions is through the return value. For example, suppose we create a loadfile() function that returns true if it loaded the
More informationObject-Oriented Programming, Iouliia Skliarova
Object-Oriented Programming, Iouliia Skliarova A reference (&) is like a constant pointer that is automatically dereferenced. There are certain rules when using references: 1. A reference must be initialized
More informationSecurity Workshop HTS. LSE Team. February 3rd, 2016 EPITA / 40
Security Workshop HTS LSE Team EPITA 2018 February 3rd, 2016 1 / 40 Introduction What is this talk about? Presentation of some basic memory corruption bugs Presentation of some simple protections Writing
More informationMemory. What is memory? How is memory organized? Storage for variables, data, code etc. Text (Code) Data (Constants) BSS (Global and static variables)
Memory Allocation Memory What is memory? Storage for variables, data, code etc. How is memory organized? Text (Code) Data (Constants) BSS (Global and static variables) Text Data BSS Heap Stack (Local variables)
More information15-213/18-243, Spring 2011 Exam 2
Andrew login ID: Full Name: Section: 15-213/18-243, Spring 2011 Exam 2 Thursday, April 21, 2011 v2 Instructions: Make sure that your exam is not missing any sheets, then write your Andrew login ID, full
More informationAgenda. Components of a Computer. Computer Memory Type Name Addr Value. Pointer Type. Pointers. CS 61C: Great Ideas in Computer Architecture
CS 61C: Great Ideas in Computer Architecture Krste Asanović & Randy Katz http://inst.eecs.berkeley.edu/~cs61c And in Conclusion, 2 Processor Control Datapath Components of a Computer PC Registers Arithmetic
More informationInt. J. of Advanced Networking and Applications 181 Volume: 01 Issue: 03 Pages: (2009)
Int. J. of Advanced Networking and Applications 181 Dynamic channel allocation for user demanded packet optimality Focus on network initialization Procedure Dr. Pradeep. B.S Asst. Professor, Department
More informationPreview. Process Control. What is process? Process identifier The fork() System Call File Sharing Race Condition. COSC350 System Software, Fall
Preview Process Control What is process? Process identifier The fork() System Call File Sharing Race Condition COSC350 System Software, Fall 2015 1 Von Neumann Computer Architecture: An integrated set
More informationSystem Programming. Signals I
Content : by Dr. B. Boufama School of Computer Science University of Windsor Instructor: Dr. A. Habed adlane@cs.uwindsor.ca http://cs.uwindsor.ca/ adlane/60-256 Content Content 1 Introduction 2 3 Signals
More informationCS 61C: Great Ideas in Computer Architecture. Lecture 3: Pointers. Krste Asanović & Randy Katz
CS 61C: Great Ideas in Computer Architecture Lecture 3: Pointers Krste Asanović & Randy Katz http://inst.eecs.berkeley.edu/~cs61c Agenda Pointers in C Arrays in C This is not on the test Pointer arithmetic
More informationLight-Weight Processes: Dissecting Linux Threads
Operating Systems (Fall/Winter 2018) Light-Weight Processes: Dissecting Linux Threads Yajin Zhou (http://yajin.org) Zhejiang University source: https://opensourceforu.com/2011/08/light-weight-processes-dissecting-linux-threads/
More informationECE264 Fall 2013 Exam 3, November 20, 2013
ECE264 Fall 2013 Exam 3, November 20, 2013 In signing this statement, I hereby certify that the work on this exam is my own and that I have not copied the work of any other student while completing it.
More informationUnderstanding Pointers
Division of Mathematics and Computer Science Maryville College Pointers and Addresses Memory is organized into a big array. Every data item occupies one or more cells. A pointer stores an address. A pointer
More informationlibnetfilter_log Reference Manual
libnetfilter_log Reference Manual x.y Generated by Doxygen 1.4.6 Tue Mar 21 13:47:12 2006 CONTENTS 1 Contents 1 libnetfilter_log File Index 1 2 libnetfilter_log File Documentation 1 1 libnetfilter_log
More informationLab Exam 1 D [1 mark] Give an example of a sample input which would make the function
CMPT 127 Spring 2019 Grade: / 20 First name: Last name: Student Number: Lab Exam 1 D400 1. [1 mark] Give an example of a sample input which would make the function scanf( "%f", &f ) return -1? Answer:
More informationFeatures 2.4 GHz Carrier Frequency RS232 UART interface with variable baud rate Input supply voltage: 5V to 12V 255 possible Channels frequencies (0 to 255) Programmable Device Address (255 per channel)
More informationFile Descriptors and Piping
File Descriptors and Piping CSC209: Software Tools and Systems Programming Furkan Alaca & Paul Vrbik University of Toronto Mississauga https://mcs.utm.utoronto.ca/~209/ Week 8 Today s topics File Descriptors
More informationSTD_CU43USBSW_V1.0E. CUnet (MKY43) USB Unit. CU-43USB Software Manual
STD_CU43USBSW_V1.0E CUnet (MKY43) USB Unit CU-43USB Software Manual Introduction This document describes API included with CU-43USB unit. Before using the product, please check the latest information on
More informationWhy files? 1. Storing a large amount of data 2. Long-term data retention 3. Access to the various processes in parallel
1 File System Why files? 1. Storing a large amount of data 2. Long-term data retention 3. Access to the various processes in parallel 2 Basic Terms File Structures Field basic unit of data. Contains single
More informationCS 471 Operating Systems. Yue Cheng. George Mason University Fall 2017
CS 471 Operating Systems Yue Cheng George Mason University Fall 2017 1 Review: Sync Terminology Worksheet 2 Review: Semaphores 3 Semaphores o Motivation: Avoid busy waiting by blocking a process execution
More informationA linear-list Data Structure where - addition of elements to and - removal of elements from are restricted to the first element of the list.
A linear-list Data Structure where - addition of elements to and - removal of elements from are restricted to the first element of the list. the first element of the list a new element to (the Top of)
More informationPerformance Considerations and GMAC
Performance Considerations and GMAC 1 Warps and Thread Execution Theoretically all threads in a block can execute concurrently Hardware cost forces compromise Bundle threads with a single control unit
More informationECE 650 Systems Programming & Engineering. Spring 2018
ECE 650 Systems Programming & Engineering Spring 2018 Inter-process Communication (IPC) Tyler Bletsch Duke University Slides are adapted from Brian Rogers (Duke) Recall Process vs. Thread A process is
More informationCS342 - Spring 2019 Project #3 Synchronization and Deadlocks
CS342 - Spring 2019 Project #3 Synchronization and Deadlocks Assigned: April 2, 2019. Due date: April 21, 2019, 23:55. Objectives Practice multi-threaded programming. Practice synchronization: mutex and
More informationIEEE Broadband Wireless Access Working Group <
Project Title Date Submitted IEEE 802.16 Broadband Wireless Access Working Group Transparent Uplink Relaying for OFDMA 2004-11-04 Source(s) Kevin Baum Brian Classon Mark Cudak Philippe
More informationCSE 153 Design of Operating Systems Fall 2018
CSE 153 Design of Operating Systems Fall 2018 Lecture 4: Processes (2) Threads Process Creation: Unix In Unix, processes are created using fork() int fork() fork() Creates and initializes a new PCB Creates
More informationProject 2--User Programs
Project 2--User Programs Jason Bau CS140 Winter 09 Slides Acknowledgements to previous CS140 TAs User Program/Process What happens in Unix shell when? myth13:~/> cp r pintos. 1. Shell handles user input
More informationThreads. What is a thread? Motivation. Single and Multithreaded Processes. Benefits
CS307 What is a thread? Threads A thread is a basic unit of CPU utilization contains a thread ID, a program counter, a register set, and a stack shares with other threads belonging to the same process
More informationHow to use RFpro in Packet Mode
How to use RFpro in Packet Mode Jumper Setting Priority Jumper J1 à Configuration Mode Jumper à Higher Priority Jumper J2 à Packet Mode Jumper à Lower Priority When both the jumpers are connected, by default,
More informationChapter 6: CPU Scheduling
Chapter 6: CPU Scheduling Silberschatz, Galvin and Gagne Histogram of CPU-burst Times 6.2 Silberschatz, Galvin and Gagne Alternating Sequence of CPU And I/O Bursts 6.3 Silberschatz, Galvin and Gagne CPU
More information628 Lecture Notes Week 4
628 Lecture Notes Week 4 (February 3, 2016) 1/8 628 Lecture Notes Week 4 1 Topics I/O Redirection Notes on Lab 4 Introduction to Threads Review Memory spaces #include #include int
More informationCS240: Programming in C
CS240: Programming in C Lecture 17: Processes, Pipes, and Signals Cristina Nita-Rotaru Lecture 17/ Fall 2013 1 Processes in UNIX UNIX identifies processes via a unique Process ID Each process also knows
More informationNETWORK AND SYSTEM PROGRAMMING
NETWORK AND SYSTEM PROGRAMMING LAB 09 Network Byte Ordering, inet_aton, inet_addr, inet_ntoa Functions Objectives: To learn byte order conversion To understand inet-aton, inet_addr, inet_ntoa Functions
More informationSS Initialization Overview
SS Initialization Overview Downlink Sync Auth. Key Xchange Get Uplink Parameters Setup Time Ranging Register Download Configuration File Capability Negotiation DHCP Setup connection and service flow (provisioned
More informationMAC Overview NCHU CSE WMAN - 1
MAC Overview NCHU CSE WMAN - 1 MAC Overview Connection-oriented Supports difficult user environments High bandwidth, hundreds of users per channel For variable Continuous and Burst traffic Very efficient
More informationCSE 12 Spring 2016 Week One, Lecture Two
CSE 12 Spring 2016 Week One, Lecture Two Homework One and Two: hw2: Discuss in section today - Introduction to C - Review of basic programming principles - Building from fgetc and fputc - Input and output
More informationMessage definition to support MS network entry in centralized allocation model
Project Title Date Submitted IEEE 802.16 Broadband Wireless Access Working Group Message definition to support MS network entry in centralized allocation model 2007-01-08 Source(s)
More informationPESIT Bangalore South Campus Hosur road, 1km before Electronic City, Bengaluru -100 Department of Information Sciences and Engineering
INTERNAL ASSESSMENT TEST 2 Solutions 1. Explain the working of the waitpid() API with the help of a program. The program needs to take 2 command line arguments: the first argument should be used as the
More informationCSE 410: Systems Programming
CSE 410: Systems Programming Input and Output Ethan Blanton Department of Computer Science and Engineering University at Buffalo I/O Kernel Services We have seen some text I/O using the C Standard Library.
More informationOS lpr. www. nfsd gcc emacs ls 1/27/09. Process Management. CS 537 Lecture 3: Processes. Example OS in operation. Why Processes? Simplicity + Speed
Process Management CS 537 Lecture 3: Processes Michael Swift This lecture begins a series of topics on processes, threads, and synchronization Today: processes and process management what are the OS units
More informationCOSC Software Engineering. Lecture 16: Managing Memory Managers
COSC345 2013 Software Engineering Lecture 16: Managing Memory Managers Outline Typical problems (from previous lectures) Memory leaks aren t just for (Objective) C Tracking malloc() calls Catching calls
More informationLab Exam 1 D [1 mark] Give an example of a sample input which would make the function
Grade: / 20 Lab Exam 1 D500 1. [1 mark] Give an example of a sample input which would make the function scanf( "%f", &f ) return 0? Answer: Anything that is not a floating point number such as 4.567 or
More informationCSCI-243 Exam 1 Review February 22, 2015 Presented by the RIT Computer Science Community
CSCI-243 Exam 1 Review February 22, 2015 Presented by the RIT Computer Science Community http://csc.cs.rit.edu History and Evolution of Programming Languages 1. Explain the relationship between machine
More informationCSC Execution Environment. Program Execution Environment
CSC 1600 Program Execution Environment Execution Environment The main func*on is the entry point for C program execu*on int main( int argc, char * argv[]); The linker (called by the C compiler) specifies,
More informationAnnouncements. Lecture 05a Header Classes. Midterm Format. Midterm Questions. More Midterm Stuff 9/19/17. Memory Management Strategy #0 (Review)
Announcements Lecture 05a Sept. 19 th, 2017 9/19/17 CS253 Fall 2017 Bruce Draper 1 Quiz #4 due today (before class) PA1/2 Grading: If something is wrong with your code, you get sympathy PA3 is due today
More informationCSC 2405: Computer Systems II
CSC 2405: Computer Systems II Program Execution Environment Execution Environment The main func*on is the entry point for C program execu*on int main( int argc, char * argv[]); The linker (called by the
More informationOperating systems for embedded systems. Embedded Operating Systems
Operating systems for embedded systems Embedded operating systems How do they differ from desktop operating systems? Programming model Process-based Event-based How is concurrency handled? How are resource
More informationCSE 333 Final Exam June 6, 2017 Sample Solution
Question 1. (24 points) Some C and POSIX I/O programming. Given an int file descriptor returned by open(), write a C function ReadFile that reads the entire file designated by that file descriptor and
More informationCSE 4/521 Introduction to Operating Systems
CSE 4/521 Introduction to Operating Systems Lecture 9 CPU Scheduling II (Scheduling Algorithms, Thread Scheduling, Real-time CPU Scheduling) Summer 2018 Overview Objective: 1. To describe priority scheduling
More informationFile Systems: Consistency Issues
File Systems: Consistency Issues File systems maintain many data structures Free list/bit vector Directories File headers and inode structures res Data blocks File Systems: Consistency Issues All data
More informationCSC209H Lecture 3. Dan Zingaro. January 21, 2015
CSC209H Lecture 3 Dan Zingaro January 21, 2015 Streams (King 22.1) Stream: source of input or destination for output We access a stream through a file pointer (FILE *) Three streams are available without
More informationHomework 2 Answers. Due Date: Monday, April 29, 2002, at 11:59PM Points: 100
Homework 2 Answers Due Date: Monday, April 29, 2002, at 11:59PM Points: 100 UNIX System 1. (10 points) What program is running as process #1? Type ps ax and look for the process with a PID of 1. Then look
More informationCSC209H Lecture 10. Dan Zingaro. March 18, 2015
CSC209H Lecture 10 Dan Zingaro March 18, 2015 Creating a Client To create a client that can connect to a server, call the following, in order: socket: create a communication endpoint This is the same as
More informationBristol Institute of Technology
Bristol Institute of Technology Academic Year: 09/10 Module Leader: Module Code: Title of Module: Ian Johnson UFCETS-20-1 Programming in C Examination Date: Monday 12 th January 2009 Examination Start
More information20-EECE-4029 Operating Systems Fall, 2015 John Franco
20-EECE-4029 Operating Systems Fall, 2015 John Franco Final Exam name: Question 1: Processes and Threads (12.5) long count = 0, result = 0; pthread_mutex_t mutex; pthread_cond_t cond; void *P1(void *t)
More informationOperating systems for embedded systems
Operating systems for embedded systems Embedded operating systems How do they differ from desktop operating systems? Programming model Process-based Event-based How is concurrency handled? How are resource
More informationCS321: Computer Networks Introduction to Application Layer
CS321: Computer Networks Introduction to Application Layer Dr. Manas Khatua Assistant Professor Dept. of CSE IIT Jodhpur E-mail: manaskhatua@iitj.ac.in Basic Application layer provides services to the
More informationEL2310 Scientific Programming
Lecture 12: Memory, Files and Bitoperations (pronobis@kth.se) Overview Overview Lecture 12: Memory, Files and Bit operations Wrap Up Main function; reading and writing Bitwise Operations Wrap Up Lecture
More informationThe Data may not be disclosed or distributed to third parties, in whole or in part, without the prior written consent of Motion Workshop.
C API Reference Motion Version 2.6 www.motionnode.com www.motionshadow.com Copyright c 2017 Motion Workshop. All rights reserved. The coded instructions, statements, computer programs, and/or related material
More information4.8 Summary. Practice Exercises
Practice Exercises 191 structures of the parent process. A new task is also created when the clone() system call is made. However, rather than copying all data structures, the new task points to the data
More informationCS 223: Data Structures and Programming Techniques. Exam 2. April 19th, 2012
CS 223: Data Structures and Programming Techniques. Exam 2 April 19th, 2012 Instructor: Jim Aspnes Work alone. Do not use any notes or books. You have approximately 75 minutes to complete this exam. Please
More informationPRINCIPLES OF OPERATING SYSTEMS
PRINCIPLES OF OPERATING SYSTEMS Tutorial-1&2: C Review CPSC 457, Spring 2015 May 20-21, 2015 Department of Computer Science, University of Calgary Connecting to your VM Open a terminal (in your linux machine)
More information