This preview shows pages 1–2. Sign up to view the full content.
This preview has intentionally blurred sections. Sign up to view the full version.View Full Document
Unformatted text preview: CDA6530: Performance Models of Computers and Networks (Fall 2011) Homework 2: Random processes and M/M/* queue (assigned 10/04; due: 10/12 midnight, submitted via webcourse) 1. Jobs arrive at a computer center following a Poisson process with rate . The computer center has two computers called A and B. We split the arriving work evenly between the two computers using one of the following two splitting rules: Rule 1: Each arriving job flips a fair coin to decide which computer queue to join; lets say heads it goes to computer A and tails it goes to computer B. Rule 2: Assuming the jobs are numbered in sequence, the even numbered jobs are directed to computer A and the odd numbered jobs are directed to computer B. Clearly, Rule 1 is randomized and Rule 2 is deterministic. Under either rule 1 or rule 2, the arrival processes at the two computers are identical stochastically. (a). What is the distribution of the inter-arrival time for computer A under rule 1 and rule 2, respectively. Please give the distribution pdf function. give the distribution pdf function....
View Full Document
This note was uploaded on 01/14/2012 for the course CDA 6530 taught by Professor Zou during the Fall '11 term at University of Central Florida.
- Fall '11