CSE681 Lecture #17 Lecture #17 - Queuing Theory and Performance Analysis 19 July 2009 ../../webpages/FawcettHome.xml ../../webpages/Courses.xml ../../webpages/Code.xml www.ecs.syr.edu/faculty/fawcett/handouts ../../webpages/CoreTechnologies.xml ../../webpages/Books.xml ../../webpages/Articles.xml ../../webpages/Mathematics.xml ../../webpages/research.xml ../../webpages/MastersProjects.xml ../../webpages/swdev.xml ../../webpages/webdev.xml ../../webpages/news.xml ../../webpages/OtherLinks.xml ../../webpages/SiteDesign.xml ../../webpages/graduates.xml ../../webpages/AllPages.xml ../../webpages/OfficeHours.xml ../../webpages/notices.xml Contents ../../webpages/CSE681.xml ../../webpages/CSE686.xml ../../webpages/CSE687.xml ../../webpages/CSE775.xml ../../webpages/CSE776.xml ../../webpages/CSE778.xml ../../webpages/CSE784.xml ../Lectures/CSE681CodeL1.xml ../lectures/CSE681CodeL2.xml ../Lectures/CSE681CodeL3.xml ../Lectures/CSE681CodeL4.xml ../Lectures/CSE681CodeL5.xml ../Lectures/CSE681CodeL6.xml ../Lectures/CSE681CodeL7.xml
../Lectures/CSE681CodeL8.xml ../Lectures/CSE681CodeL9.xml ../Lectures/CSE681CodeL10.xml ../Lectures/CSE681CodeL11.xml ../Lectures/CSE681CodeL12.xml ../Lectures/CSE681CodeL13.xml ../Lectures/CSE681CodeL14.xml
../Lectures/CSE681CodeL15.xml ../Lectures/CSE681CodeL16.xml ../Lectures/CSE681CodeL17.xml ../Lectures/CSE681CodeL18.xml ../Lectures/CSE681CodeL19.xml ../Lectures/CSE681CodeL20.xml ../Lectures/CSE681CodeL21.xml Contents Syllabus

bdn.borland.com/article/0,1410,31863,00.html www.w3schools.com www.codeproject.com/ www.msdn.microsoft.com www.develop.com/devresources/default.aspx xml.com sellsbrothers.com www.wdj.com windowsclient.net// www.dotnetjunkies.com www.learnasp.com/quickstart/ www.c-sharpcorner.com www.go-mono.com msdn.microsoft.com/en-us/library/w8f5kw2e(VS.71).aspx

../../webpages/officeHours.xml

This lecture explores a little Queuing theory and introduces techniques for performance analysis for Project #5. The Syllabus describes topics to be covered, reading material for you to digest before coming to class, and due dates for the assigned projects. The Midterm Makeup Exam consists of two parts: For every question in the exam you took in class this summer, explain what was wrong with your answers. Please do not feed back my solution, just criticize your answer. Complete all the questions in ../midterm/MTMUSu09.doc. This is a take home make up examination. If you complete it flawlessly, your midterm grade will be raised to an 85, but no higher. You may ask any question you wish about the examination on Wednesday. I will give clear answers about how to tackle the problem in question. ../projects/Pr5Su09.doc ../presentations/OrganizingPrinciplesForProject5.doc - a "chalk talk". ../presentations/SizeTimeEstimatesPr5F05.doc - some more "chalk talk". Some timed executions: ../../coretechnologies/SocketsAndRemoting/code/WCF_Fawcett_Examples/TimedFileStreaming ../code/TestHarnessPrototype ../code/RunCompiler ../presentations/QueueAnalysis.doc ../code/HiResTimerInterop ../code/RandomEvents ../presentations/ArchitectureTaxonomy.ppt ../../CoreTechnologies/SocketsAndRemoting/code/WCF_Fawcett_Examples/WCF_PeerComm Illustrates use of WCF in Sender/Receiver configuration. ../../CoreTechnologies/SocketsAndRemoting/code/WCF_Fawcett_Examples/WCF_MessagePassingComm This demo is a good example of what you need for Projects #4 and #5. ../../CoreTechnologies/SocketsAndRemoting/code/WCF_Fawcett_Examples/FileStreaming This demo is a good example of what you need for Projects #4 and #5.

---