Browse

ftp://cs.pitt.edu (148)

	ftp://cs.pitt.edu//berson/papers/pact93.ps, 19930125 Presented at IFIP WG 10.3(Concurrent Systems) Working Conference on Architectures and Compliation Techniques for Fine and Medium Grain Parallelism, Orlando, Fl., January 1993 URSA: A Unified ReSource Allocator for Registers and Functional Units in VLIW Architectures David A. Berson, Rajiv Gupta, and
	ftp://cs.pitt.edu//pldi94/pugh.ps, 19930804 Advice to Authors of Extended Abstracts William Pugh Dept. of Computer Science and Institute for Advanced Computer Studies Univ. of Maryland, College Park July 16, 1993 This article stems from discussions among the program committee for SIGPLAN'91 PLDI. The program committee thought it might be useful
	ftp://cs.pitt.edu//chang/petri93.ps.Z, 19931127 Integrating Software Engineering Methods and Petri Nets for the Specification and Prototyping of Complex Information Systems Yi Deng1, S.K. Chang2, Jorge C.A. de Figueired2 and Angelo Perkusich2 1 School of Computer Science Florida International University { Miami, FL 33199 { USA 2 Department of
	ftp://cs.pitt.edu//carenini/storage/document/Documentation.ps, 19931215 THE MIGRAINE PROJECT KNOWLEDGE BASE DOCUMENTATION Giuseppe Carenini December 9, 1993 1 INTRODUCTION This document describes the current status of the knowledge base (kb) of medical concepts for the migraine project. Since the architectural choices in designing a kb strongly depend on the envisioned use
	ftp://cs.pitt.edu//carenini/storage/document/final-scamc93.ps, 19931215 Using the UMLS Semantic Network as a Basis for Constructing a Terminological Knowledge Base: A Preliminary Report Giuseppe Carenini and Johanna D. Moore University of Pittsburgh, Department of Computer Science Pittsburgh, PA 15260 Sharing and reuse of knowledge bases is recognized in Artificial
	ftp://cs.pitt.edu//realtime/ft-scenarios94.ps.gz, 19940208 Mechanisms for System-Level Fault Tolerance in Real-Time Systems Daniel Moss e Department of Computer Science University of Pittsburgh Pittsburgh, PA 15260 mosse@cs.pitt.edu 1 Introduction Modern robotics applications are becoming more complex due to the increasing number of resources to be controlled,
	ftp://cs.pitt.edu//field/papers/jsac-oct93.ps.gz, 19940313 A Network Framework to Support Application Real-Time Performance Guarantees Brian Field Taieb Znatiy Computer Science Department University of Pittsburgh Pittsburgh, PA 15260
	ftp://cs.pitt.edu//realtime/ft-sch-analysis-ftcs94.ps.gz, 19940424 Analysis of a Fault-Tolerant Multiprocessor Scheduling Algorithm Daniel Moss e, Rami Melhem, and Sunondo Ghosh Department of Computer Science University of Pittsburgh Pittsburgh, PA 15260 fmosse,melhem,ghoshg@cs.pitt.edu Keywords: Fault Tolerance, Real Time, Operating Systems, Primary/Backup, Redundancy
	ftp://cs.pitt.edu//realtime/dist-scheduling.ps.gz, 19940602 Multiple Resource Allocation for Multiprocessor Distributed Real-Time Systems Daniel Moss e Department of Computer Science University of Pittsburgh Pittsburgh, PA 15260 mosse@cs.pitt.edu Sam H. Noh, Bao Trinh, Ashok K. Agrawala Systems Design and Analysis Group Department of Computer Science University
	ftp://cs.pitt.edu//chang/dms94.ps.Z, 19940606 1 Introduction Figure 1 illustrates the block diagram of a distributed multimedia system, in which there are three different multimedia schemas playing essential roles. The Multimedia Static Schema (MSS) of a distributed multimedia system (DMS) specifies the static structure of the composite multimedia
	ftp://cs.pitt.edu//chang/avi.ps.Z, 19940606 Database Schema Evolution using EVER Diagrams Chien-Tsai Liu Shi-Kuo Chang Panos K. Chrysanthis Department of Computer Science University of Pittsburgh, Pittsburgh, PA 15260
	ftp://cs.pitt.edu//chang/icpp94.ps.Z, 19940610 Undoing Code Transformations in an Independent Order Chyi-Ren Dow Mary Lou Soffa Shi-Kuo Chang dow@cs.pitt.edu soffa@cs.pitt.edu chang@cs.pitt.edu Department of Computer Science University of Pittsburgh Pittsburgh, PA 15260
	ftp://cs.pitt.edu//chang/supcom92.ps.Z, 19940610 - 194 - A Visualization System for Parallelizing Programs Chyi-Ren Dow, Shi-Kuo Chang and Mary Lou Soffa Department of Computer Science University of Pittsburgh Pittsburgh, PA 15260
	ftp://cs.pitt.edu//pollack/aaai94.ps, 19940620 To appear in the 12th National Conference on Artificial Intelligence (AAAI), Aug., 1994 Least-Cost Flaw Repair: A Plan Refinement Strategy for Partial-Order Planning David Joslin and Martha E. Pollacky; Intelligent Systems Program yDepartment of Computer Science University of Pittsburgh, Pittsburgh, PA
	ftp://cs.pitt.edu//pollack/aips94.ps, 19940620 Appears in the 2nd International Conference on AI Planning Systems (AIPS), pp. 188-193, 1994 Decomposition and Causality in Partial-Order Planning R. Michael Youngy and Martha E. Pollack ;y and Johanna D. Moore ;y;x yIntelligent Systems Program Department of Computer Science xLearning Research and
	ftp://cs.pitt.edu//pollack/dipart.ps, 19940620 Appears in the Proceedings of the ARPI Annual Meeting, Tucson, AZ, 1994 The DIPART Project: A Status Report Martha E. Pollack, Taieb Znati, Eithan Ephrati, David Joslin, Sylvain Lauzac, Arthur Nunes, Nilufer Onder, Yagil Ronen, Sigalit Ur Department of Computer Science and Intelligent Systems Program
	ftp://cs.pitt.edu//carenini/storage/history-taking.ps, 19940711 Figure 2. A simple screen asking about headache triggers. Each screen begins with general text meant to provide context. The questions are shown in the body of the screen, with standard navigating boxes at the bottom. The actual screen uses color as well as location to separate these different kinds of
	ftp://cs.pitt.edu//carenini/storage/document/um94poster.ps, 19940711 Generating Patient Specific Explanations in Migraine Giuseppe Carenini Vibhu O. Mittal Johanna D. Moore Intelligent Systems Program Computer Science Department Computer Science & LRDC University of Pittsburgh University of Pittsburgh University of Pittsburgh Pittsburgh, PA 15260 Pittsburgh, PA 15260
	ftp://cs.pitt.edu//carenini/storage/document/iwiui92-v2.ps, 19940711 GENERATING EXPLANATIONS IN CONTEXT Giuseppe Carenini Department of Computer Science University of Pittsburgh Pittsburgh, PA 15260 U.S.A. Telephone: (412) 624-9185 carenini@cs.pitt.edu Johanna D. Moore Department of Computer Science and Learning Research and Development Center University of Pittsburgh
	ftp://cs.pitt.edu//carenini/storage/system-architecture.ps, 19940711 DOCTOR/NURSE COMPUTER INTERACTION PATIENT COMPUTER INTERACTION DOCTOR/NURSE PATIENT INTERACTION GENERATED TEXTWELL-ORGANIZED SUMMARY FOR THE DOCTOR INITIAL VISIT HISTORY-TAKING FOLLOW-UP VISIT ASK ABOUT OUTCOMES OF THE TREATMENT SUMMARY DESCRIBING WHAT THE PATIENT SHOULD KNOW AFTER THE VISIT (DIAGNOSIS,
	ftp://cs.pitt.edu//carenini/storage/migraine-system-architecture.ps, 19940711 1 2.1 2.2 DOCTOR EXPLANATION MODULE HISTORY TAKING MODULE PATIENT HISTORY SUMMARY PATIENT PATIENT HANDOUT Patient Model 4.1 4.2 6 5 3 INTERACTION MANAGER Figure 1. System Architecture: Information flow between patient and doctor. Information flow is shown by the arrows. Numbered arrows involve the
	ftp://cs.pitt.edu//chang/real.ps.Z, 19940801 Reality Bites - Progressive Querying and Result Visualization in Logical and VR Spaces Shi-Kuo Chang, Maria F. Costabile+ and Stefano Levialdi++ Dept. of Computer Science, University of Pittsburgh, Pittsburgh, PA. 15260, U.S.A. +Dip. di Informatica, Universita' di Bari, Via Orabona 4, 70126 Bari -
	ftp://cs.pitt.edu//ft/kalyan-pruhs2.ps.gz, 19940819 Fault-Tolerant Scheduling Bala Kalyanasundaram Computer Science Department University of Pittsburgh kalyan@cs.pitt.edu Kirk R. Pruhsy Computer Science Department University of Pittsburgh kirk@cs.pitt.edu
	ftp://cs.pitt.edu//ft/kalyan-pruhs1.ps.gz, 19940819 Randomized Algorithms for Real-time Scheduling with Fault-tolerance (Preliminary Version) Bala Kalyanasundaram Kirk Pruhsy
	ftp://cs.pitt.edu//realtime/ft-res-alloc.ps.gz, 19940908 Allocation of Real-Time Computations under Fault Tolerance Constraints Shem-Tov Levi, Daniel Moss e, and Ashok K. Agrawala Systems Design and Analysis Group Department of Computer Science University of Maryland College Park, MD 20742
	ftp://cs.pitt.edu//info/acls.ps, 19940926 Computing and Information Services Date: October 1994 Series: UNIX Pittsburgh, PA 15260 Ref. #: UNX-9205-24.0 (412) 624-6355 Filename: ACLS Using ACLS Setting and Listing ACLS in AFS This help sheet explains how to set protections for files and directories in the Andrew File System. What are ACLs in AFS
	ftp://cs.pitt.edu//chang/icpads94.ps.Z, 19940926 An Efficient Technique to Remove Transformations Chyi-Ren Dow Mary Lou Soffa Shi-Kuo Chang dow@cs.pitt.edu soffa@cs.pitt.edu chang@cs.pitt.edu Department of Computer Science University of Pittsburgh Pittsburgh, PA 15260
	ftp://cs.pitt.edu//chang/ics94.ps.Z, 19941001 An Overview of the PIVOT Environment for Program Restructuring Chyi-Ren Dow Shi-Kuo Chang Mary Lou Soffa dow@cs.pitt.edu chang@cs.pitt.edu soffa@cs.pitt.edu Department of Computer Science University of Pittsburgh Pittsburgh, PA 15260
	ftp://cs.pitt.edu//realtime/mosse_diss.ps.gz, 19941012 Chapter 1 Introduction Computer systems and computer networks in modern times are evolving into very complex entities. This evolution continues to be fueled by technological advances as well as by the rapid growth in computer networks. Moreover, user reliance on these systems continues to increase the
	ftp://cs.pitt.edu//pollack/cs2711/ucpop/ucpop-kr92.ps, 19941103 UCPOP: A Sound, Complete, Partial Order Planner for ADL J. Scott Penberthy IBM T.J. Watson Research Center P.O Box 704 Yorktown Heights, NY 10598 jsp@watson.ibm.com Daniel S. Weld Department of Computer Science and Engineering University of Washington Seattle, WA 98105 weld@cs.washington.edu
	ftp://cs.pitt.edu//pollack/cs2711/ucpop/manual.ps, 19941103 ucpop User's Manual (Version 2.0) Anthony Barrett, Keith Golden, Scott Penberthy & Daniel Weld Technical Report 93-09-06 February 1, 1994 Department of Computer Science and Engineering1 University of Washington Seattle, WA 98105 bug-ucpop@cs.washington.edu 1We thank Marc Young for contributions to the
	ftp://cs.pitt.edu//chang/ams.ps.Z, 19941106 Page 1 Tele-Action Objects for an Active Multimedia System Hui-Jung Chang, Tai-Yuan Hou+, Arding Hsu+, Shi-Kuo Chang * Department of Computer Science, University of Pittsburgh, 215A MIB, Pittsburgh, PA 15260 Tel: (412) 624-8423 Fax: (412) 624-8465 + Siemens Corporate Research, 755 College Road East,
	ftp://cs.pitt.edu//chang/ijseke95.ps.Z, 19941108 Object Oriented Design, Modular Analysis, and Fault-Tolerance of Real-Time Control Software Systems Angelo Perkusichy, Maria L.B. Perkusichy and Shi-Kuo Changz yElectrical Engineering Department Universidade Federal da Para ba Caixa Postal 10105 58109-970 - Campina Grande - PB - Brazil Fone: +55 83 333
	ftp://cs.pitt.edu//berson/papers/pact94.ps, 19941110 Presented at IFIP WG 10.3 Working Conference on Parallel Architectures and Compilation Techniques (PACT), August, 1994, Montreal, Canada Resource Spackling: A Framework for Integrating Reg- ister Allocation in Local and Global Schedulersy David A. Berson, Rajiv Gupta, and Mary Lou Soffa Computer Science
	ftp://cs.pitt.edu//berson/papers/tr92-21.ps, 19941111 Technical Report 92-21 URSA: A Unified ReSource Allocator for Registers and Functional Units In VLIW Architectures yz David A. Berson Rajiv Gupta Mary Lou Soffa Department of Computer Science University of Pittsburgh Pittsburgh, PA 15260 (berson@cs.pitt.edu) December 1992 yPartially supported by
	ftp://cs.pitt.edu//berson/papers/tr94-09.ps, 19941205 Technical Report 94-09 Resource Spackling: A Framework for Integrating Register Allocation in Local and Global Schedulers yz David A. Berson Rajiv Gupta Mary Lou Soffa Department of Computer Science University of Pittsburgh Pittsburgh, PA 15260 Fax: (412) 624-5249 (berson@cs.pitt.edu) February 1994
	ftp://cs.pitt.edu//berson/papers/tr94-10.ps, 19941205 Technical Report 94-10 Representing Architecture Constraints in URSA y David A. Berson Rajiv Gupta Mary Lou Soffa Department of Computer Science University of Pittsburgh Pittsburgh, PA 15260 Fax: (412) 624-5249 (berson@cs.pitt.edu) February 1994 yPartially supported by National Science Foundation
	ftp://cs.pitt.edu//chang/ic.ps.Z, 19941224 TOWARD A THEORY OF ACTIVE INDEX Shi-Kuo Chang Visual Computer Laboratory Department of Computer Science, University of Pittsburgh Pittsburgh, PA 15260 USA (Email: chang@cs.pitt.edu)
	ftp://cs.pitt.edu//chang/ic.f4.ps.Z, 19950118 Dr. Hou, Enclosed is a nuclear image of my patient John Friedman. My annotation is included. Please review it and give me your commands. Thank you. Paul Hart text attachment Attach_1.2 audio and moving pen annotation Annot_2.1.2
	ftp://cs.pitt.edu//chang/ic.f5.ps.Z, 19950118 ic1 ic2 m2 m1 m1 machine boundary IC Manager1 IC Manager2 ic3 m2 m2 Figure 5. The IC Manager.
	ftp://cs.pitt.edu//berson/papers/tr95-06.ps, 19950213 Technical Report 95-06 HARE: A Hierarchical Allocator for Registers in Multiple Issue Architectures y David A. Berson Rajiv Gupta Mary Lou Soffa Computer Science Department University of Pittsburgh Pittsburgh, Pa. 15260 Fax: (412) 624-5249 February 1995
	ftp://cs.pitt.edu//berson/papers/gurrr.ps, 19950213 GURRR: A Global Unified Resource Requirements Representation David A. Berson berson@cs.pitt.edu Rajiv Gupta gupta@cs.pitt.edu Mary Lou Soffa soffa@cs.pitt.edu Computer Science Department University of Pittsburgh Pittsburgh, Pa. 15260 Fax: (412) 624-5249
	ftp://cs.pitt.edu//berson/papers/resume.ps, 19950214 Curriculum Vitae David A. Berson 5551 Beacon St. Pittsburgh, Pa. 15217 (412) 421-9730 berson@cs.pitt.edu http://www.cs.pitt.edu/~berson Research Interests Compilation techniques for fine grain parallel architectures, including integration of register allocation and instruction scheduling, parallelizing
	ftp://cs.pitt.edu//realtime/v-net.ps.gz, 19950223 V net : A Framework For A Versatile Network Architecture To Support Real-Time Communication Performance Guarantees Brian Field Taieb F. Znati ;y Daniel Moss e U S WEST Technologies Department of Computer Science Suite 280 yTelecommunications Program 4001 Discovery Drive University of Pittsburgh Boulder,
	ftp://cs.pitt.edu//realtime/morena-model-for-mm-authoring-large.ps.gz, 19950318 The morena Model for Hypermedia Authoring and Browsing Rodrigo Botafogo 1011 Heberton Ave Pittsburgh, PA 15206 botafogo@cs.pitt.edu Daniel Moss e Department of Computer Science University of Pittsburgh Pittsburgh, PA 15260 mosse@cs.pitt.edu
	ftp://cs.pitt.edu//realtime/morena-model-for-mm-authoring-small.ps.gz, 19950318 The morena Model for Hypermedia Authoring and Browsing Rodrigo Botafogo 1011 Heberton Ave Pittsburgh, PA 15206 botafogo@cs.pitt.edu Daniel Moss e Department of Computer Science University of Pittsburgh Pittsburgh, PA 15260 mosse@cs.pitt.edu
	ftp://cs.pitt.edu//tantush/phd.ps.gz, 19950327 PLANNING AND CONSENSUS AMONG AUTONOMOUS AGENTS a dissertation submitted to the Senate of the Hebrew University of Jerusalem in partial fulfillment of the requirements for the degree of doctor of philosophy By Eithan Ephrati October 1993 c Copyright 1993 by Eithan Ephrati ii To Aya and Shelly This work
	ftp://cs.pitt.edu//fahad/PROTOCOLS/mmsrv.ps.gz, 19950402 A Survey of Distributed Multimedia Research, Standards and Products Edited by Chris Adie Edinburgh University Computing Service University Library Building George Square Edinburgh EH8 9LJ Great Britain First Edition - 25 January 1993 RARE Project OBR(92)046v2 R seaux Associ s pour la Recherche Europ
	ftp://cs.pitt.edu//field/papers/field-thesis.ps.gz, 19950418 Network Architecture Frameworks to Support Real-Time Communication Performance Guarantees by Brian Field Submitted to the Graduate Faculty of Arts and Sciences in partial fulfillment of the requirements for the degree of Doctor of Philosophy University of Pittsburgh 1994 Network Architecture Frameworks
	ftp://cs.pitt.edu//ISL/papers/provost-buchanan-1995.ps, 19950418 Inductive Policy: The Pragmatics of Bias Selection Foster John Provost & Bruce G. Buchanan Intelligent Systems Laboratory Computer Science Department University of Pittsburgh Pittsburgh, PA 15260 foster@cs.pitt.edu (412) 624-9188
	ftp://cs.pitt.edu//realtime/networld-community-networks.ps.gz, 19950514 Management and Delivery of Multimedia Traffic Panos K. Chrysanthis and Daniel Moss e Department of Computer Science University of Pittsburgh Pittsburgh, PA 15260 fpanos,mosseg@cs.pitt.edu
	ftp://cs.pitt.edu//pollack/mtw.ps, 19950523 To Appear in the 14th International Joint Conference on Artificial Intelligence, 1995 Deriving Multi-Agent Coordination through Filtering Strategies Eithan Ephrati and Martha E. Pollack ;y and Sigalit Ury Department of Computer Science and Intelligent Systems Programy University of Pittsburgh
	ftp://cs.pitt.edu//pollack/aij.ps, 19950523 1 Appears in Artificial Intelligence, 57(1):43-68, 1992 THE USES OF PLANS Martha E. Pollack Department of Computer Science and Intelligent Systems Program University of Pittsburgh Pittsburgh, PA 15260 This is a slightly revised transcription of a lecture presented upon receipt of the Computers and
	ftp://cs.pitt.edu//pollack/tw.ps, 19950523 University of Pittsburgh Dept. of Comp. Sci. Tech. Rpt. 94-31 Submitted for Publication EXPERIMENTAL INVESTIGATION OF AN AGENT COMMITMENT STRATEGYx Martha E. Pollack ;y, David Josliny, Arthur Nunes , Sigalit Ury, and Eithan Ephrati Department of Computer Science and yIntelligent Systems Program
	ftp://cs.pitt.edu//pollack/icmas95.ps, 19950523 To Appear in the First International Conference on Multi-Agent Systems, 1995 A Tractable Heuristic that Maximizes Global Utility through Local Plan Combination Eithan Ephrati Computer Science Department University of Pittsburgh tantush@cs.pitt.edu Martha E. Pollack Computer Science Department and
	ftp://cs.pitt.edu//pollack/ijcai93.ps, 19950523 Appears in the 13th International Joint Conference on Artificial Intelligence, pp. 390-395 A Representationalist Theory of Intention Kurt Konolige Artificial Intelligence Center SRI International Menlo Park, CA 94025 Martha E. Pollacky Dept. of Computer Science Univ. of Pittsburgh Pittsburgh, PA 15260
	ftp://cs.pitt.edu//pollack/valdens.ps, 19950523 Value-Density Algorithms for Deliberation scheduling Yag l Ron en Intelligent Systems Program University of Pittsburgh Pittsburgh, PA 15260 Martha E. Pollack Department of Computer Science and Intelligent Systems Program University of Pittsburgh Pittsburgh, PA 15260 1 Introduction The problem of
	ftp://cs.pitt.edu//chang/vltao.ps.Z, 19950607 VISUAL LANGUAGES FOR TELE-ACTION OBJECTS Shi-Kuo Chang Visual Computer Laboratory Department of Computer Science University of Pittsburgh Pittsburgh, PA 15260 USA Email: chang@cs.pitt.edu
	ftp://cs.pitt.edu//ISL/papers/provost-hennessy-1994.ps, 19950621 Distributed Machine Learning: Scaling up with Coarse-grained Parallelism Foster John Provost Daniel N. Hennessy Computer Science Department University of Pittsburgh Pittsburgh, PA 15260 {foster \| hennessy}@cs.pitt.edu
	ftp://cs.pitt.edu//ISL/papers/aronis-provost-1994.ps, 19950626 Efficiently Constructing Relational Features from Background Knowledge for Inductive Machine Learning In: Proceedings AAAI-94 Workshop on Knowledge Discovery in Databases John M. Aronis and Foster J. Provost Computer Science Department University of Pittsburgh, Pittsburgh, PA 15260 aronis@cs.pitt.edu
	ftp://cs.pitt.edu//ISL/papers/provost-dissertation-2.ps, 19950626 101 maximum branching factor of av. At each node, RL4's depth-first search examines the n examples giving a time complexity of O((av)kn), which is linear in the number of examples, polynomial in the number of features, but exponential in the complexity of the representation language. If a beam search
	ftp://cs.pitt.edu//ISL/papers/provost-dissertation-1.ps, 19950626 POLICIES FOR THE SELECTION OF BIAS IN INDUCTIVE MACHINE LEARNING by Foster John Provost B.S., Duquesne University, 1986 M.S., University of Pittsburgh, 1988 Submitted to the Graduate Faculty of Arts and Sciences in partial fulfillment of the requirements for the degree of Doctor of Philosophy University
	ftp://cs.pitt.edu//ISL/papers/provost-aronis-1995.ps, 19950627 , , 1{15 () c Kluwer Academic Publishers, Boston. Manufactured in The Netherlands. Scaling Up Inductive Learning with Massive Parallelism FOSTER J. PROVOST foster@nynexst.com NYNEX Science and Technology, 400 Westchester Avenue, White Plains, NY 10604 JOHN M. ARONIS aronis@cs.pitt.edu Intelligent
	ftp://cs.pitt.edu//ISL/papers/aronis-1993.ps, 19950630 Implementing Inheritance with Roles on the Connection Machine John Michael Aronis ISP Technical Report 93-1 August 1993 Submitted to the Graduate Faculty of Arts and Sciences in partial fulfillment of the requirements for the degree of Doctor of Philosophy. To the Desert Richmond Thomason (Thesis
	ftp://cs.pitt.edu//http/htdocs/GrEdu/prelims-info/algorithm_prelim_93.ps, 19950717 Instructions: Each of the 5 questions is worth 20% of the total grade. A score of 60% is needed to guarantee a passing grade. Answers are graded on clarity as well as correctness. Some mathematical formulas that you might find helpful can be found at the end of the test questions. 1. a. Assume that we
	ftp://cs.pitt.edu//http/htdocs/GrEdu/prelims-info/algorithm_prelim_91.ps, 19950717 Algorithms Prelim Exam Fall 1991 Directions: 1. Each of the following 5 questions is worth 20 points. Some partial credit may be given, but it is better to answer a few problems fully then several problems partially. To guarantee a passing grade you should score 60 or above. 2. Read each question
	ftp://cs.pitt.edu//http/htdocs/GrEdu/prelims-info/theory_prelim.ps, 19950717 Ph. D Prelims 1994: Theory Part - Duration: 3 hrs. Instructions: Answer ALL of the following questions. The answer to each question should be in a separate test booklet. All questions are of equal importance. Be sure to give complete and comprehensible explanations and details for each part of each
	ftp://cs.pitt.edu//http/htdocs/Research/PSs/95-24.ps, 19950717 The Online Transportation Problem Bala Kalyanasundaram1 Computer Science Department University of Pittsburgh kalyan@cs.pitt.edu Kirk R. Pruhs2 Computer Science Department University of Pittsburgh kirk@cs.pitt.edu 1Supported in part by NSF under grant CCR-9202158. 2Supported in part by NSF under grant
	ftp://cs.pitt.edu//http/htdocs/GrEdu/prelims-info/algorithm_prelim_94.ps, 19950717 Instructions: Each of the 5 questions is worth 20% of the total grade. A score of 60% is needed to guarantee a passing grade. Answers are graded on clarity as well as correctness. Some mathematical formulas that you might find helpful can be found at the end of the test questions. 1. a. Define from
	ftp://cs.pitt.edu//http/htdocs/GrEdu/prelims-info/algorithm_prelim_95Jan.ps, 19950717 Algorithms Prelim January 11, 1995 Each part is worth 20 points. You should score 60 to ensure passing. You may answer all parts. Please ask questions if you do not understand a problem. Please make your answers concise. You will be graded on the correctness, completeness, and clarity of your answer. 1.
	ftp://cs.pitt.edu//http/htdocs/simsymp29.old/CFP.ps, 19950717 Call for Papers 29th Annual Simulation Symposium March 31 - April 4, 1996 g Fairmont Hotel New Orleans, Louisiana in conjunction with the SCS 1996 Simulation MultiConference The Annual Simulation Symposium is a forum for the exchange of ideas, techniques, and applications among practitioners of
	ftp://cs.pitt.edu//http/htdocs/GrEdu/prelims-info/architecture.ps, 19950717 Ph.D. Preliminary Examination Computer Architecture Topics of Emphasis and Source Materials Topics of empahasis CPU Organization Instruction Set Architecture Processor implementation Performance Metrics Pipelined and Superscaler Designs Memory Organization Physical Memory System Design Caching Systems
	ftp://cs.pitt.edu//http/htdocs/GrEdu/prelims-info/lang_prelim_Sept94.ps, 19950717 Preliminary Exam in Programming Languages September, 1994 Directions: You are to answer all of the following questions. Your answers should be legible and syntactically correct. Please start each answer on a new page. You should note that some questions are intentionally open ended. You should avoid
	ftp://cs.pitt.edu//http/htdocs/GrEdu/aid.form.ps, 19950717 Application Form for Teaching Assistantship Name: SSN.: Term of Entry: Degree Enrolled: PhD 2 MS 2 MS-AI 2 MS-SE 2 Previous Support: Term TA RA Fraction Assignment Term TA RA Fraction Assignment Support Requested: 2 Fall 199 21 234 212 214 2 Spring 199 21 234 212 214 2 Summer 199 21 234 212 214 8 It is
	ftp://cs.pitt.edu//http/htdocs/GrEdu/prelims-info/algorithm_prelim_92.ps, 19950717 Prelim Algorithms Question 9/28/92 Each part is worth 20 points. You should score 60 to ensure passing. You may answer all parts. Please feel free to ask questions if you do not understand a problem. Part 1. A. Person 1 proves that problem P has W(n2) best-case time complexity. Person 2 proves that
	ftp://cs.pitt.edu//gupta/load-store-slides.ps, 19950801 Array Data Flow Analysis for Load-Store Optimizations in Superscalar Architectures Rajiv Gupta Rastislav Bodik Problem: Load Store Operations limit the effectiveness of pipelined execution and thus the exploitation of instruction level parallelism. ffl Long Latency. ffl Unpredictable execution times.
	ftp://cs.pitt.edu//gupta/demand-dataflow.ps, 19950801 Demand-driven Computation of Interprocedural Data Flow Evelyn Duesterwald Rajiv Gupta Mary Lou Soffa Department of Computer Science University of Pittsburgh Pittsburgh, PA 15260 fduester,gupta,soffag@cs.pitt.edu
	ftp://cs.pitt.edu//gupta/load-store-paper.ps, 19950801 Array Data Flow Analysis for Load-Store Optimizations in Superscalar Architectures Rastislav Bod k and Rajiv Gupta Dept. of Computer Science, University of Pittsburgh, Pittsburgh, PA 15260
	ftp://cs.pitt.edu//http/htdocs/GrEdu/regulations.ps, 19950816 Department of Computer Science Regulations for Graduate Studies 1995-1996 1 Contents 1 Goals of the Graduate Program 3 2 Academic Standing 4 2.1 Graduate Admission Status : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 4 2.1.1 Full Graduate Status : : : : : : : : : : : : : : : : : : : :
	ftp://cs.pitt.edu//simsymp29/CFP.ps, 19950825 Call for Papers 29th Annual Simulation Symposium April 8 - April 11, 1996 g Fairmont Hotel New Orleans, Louisiana in conjunction with the SCS 1996 Simulation MultiConference The Annual Simulation Symposium is a forum for the exchange of ideas, techniques, and applications among practitioners of
	ftp://cs.pitt.edu//http/htdocs/GrEdu/prelims-info/lang_prelim_Jan95.ps, 19950901 Preliminary Exam in Programming Languages January, 1995 Directions: You are to answer all of the following questions. Your answers should be legible and syntactically correct. Please start each answer on a new page. You should note that some questions are intentionally open ended. You should avoid
	ftp://cs.pitt.edu//ISL/papers/dasse-1995.ps, 19951004 A Relational Database Interface for the RL Learning Program Seokwon Lee dasse@cs.pitt.edu Intelligent Systems Laboratory Department of Computer Science University of Pittsburgh
	ftp://cs.pitt.edu//fahad/CONGESTION/TUTORIAL.ps, 19951018 Draft Version: July 8, 1995 1 Using Rate Based Flow Control to Manage Available Bit Rate Traffic in Asynchronous Transfer Mode Networks Robert Walthall Department of Electronic Engineering Technology Brigham Young University Provo, UT 84606 Email walthalr@et.byu.edu
	ftp://cs.pitt.edu//fahad/Misc.ATM/ATM.ps, 19951018 Internetworking with ATM WANs John David Cavanaugh Timothy J. Salo Minnesota Supercomputer Center, Inc. December 14, 1992
	ftp://cs.pitt.edu//fahad/CONGESTION/Raj-Jain.ps, 19951018 Congestion Control and Traffic Management in ATM Networks: Recent Advances and A Survey1 Raj Jain Department of Computer and Information Science The Ohio State University Columbus, OH 43210 Email: Jain@ACM.Org Draft Version: January 26, 1995
	ftp://cs.pitt.edu//fahad/Misc.ATM/connless.ps.gz, 19951018 Connectionless Service for Public ATM Networks Brett J. Vickers and Tatsuya Suda bvickers@ics.uci.edu and suda@ics.uci.edu Department of Information and Computer Science, University of California, Irvine, Irvine, CA 92717-3425 (714) 856-4105 (voice) (714) 856-4056 (facsimile)
	ftp://cs.pitt.edu//realtime/ft-sch-ipps94.ps.gz, 19951023 Fault-Tolerant Scheduling on a Hard Real-Time Multiprocessor System Sunondo Ghosh, Rami Melhem and Daniel Moss e Department of Computer Science University of Pittsburgh Pittsburgh, PA 15260
	ftp://cs.pitt.edu//panos/assorted/er_94.ps, 19951026 Database Schema Evolution through the Specification and Maintenance of Changes on Entities and Relationships Chien-Tsai Liu, Panos K. Chrysanthis , Shi-Kuo Chang Department of Computer Science University of Pittsburgh, Pittsburgh, PA 15260
	ftp://cs.pitt.edu//panos/ACTA+/ACTA_thesis_91.ps.gz, 19951026 ACTA, A FRAMEWORK FOR MODELING AND REASONING ABOUT EXTENDED TRANSACTIONS A Dissertation Presented by Panayiotis Kypros Chrysanthis Submitted to the Graduate School of the University of Massachusetts in partial fulfillment of the requirements for the degree of Doctor of Philosophy September 1991
	ftp://cs.pitt.edu//panos/ACTA+/IEEE_OKE_91.ps.gz, 19951026 A Unifying Framework for Transactions in Competitive and Cooperative Environments Panayiotis K. Chrysanthis Krithi Ramamritham Department of Computer and Information Science University of Massachusetts Amherst MA. 01003
	ftp://cs.pitt.edu//panos/ACTA+/Taxonomy_VLDBJ_95.ps.gz, 19951026 A Taxonomy of Correctness Criteria in Database Applications 1 2 Krithi Ramamritham Dept. of Computer Science University of Massachusetts Amherst, MA 01003 (413) 545-0196 krithi@cs.umass.edu Panos K. Chrysanthis Dept. of Computer Science University of Pittsburgh Pittsburgh, PA 15260 (412) 624-8924
	ftp://cs.pitt.edu//panos/QBI/ride_95.ps.gz, 19951026 Visual Query of Completely Encapsulated Objects Antonio Massari Panos K. Chrysanthis Dipart. di Informatica e Sistemistica Dept. of Computer Science University of Rome La Sapienza" University of Pittsburgh 00198 - Roma, Italy Pittsburgh, PA 15260, U.S.A.
	ftp://cs.pitt.edu//panos/WMPM/apds_93.ps.gz, 19951026 Transaction Processing in Mobile Computing Environment Panos K. Chrysanthis Dept. of Computer Science University of Pittsburgh Pittsburgh, PA 15260
	ftp://cs.pitt.edu//panos/WMPM/srds_95.ps.gz, 19951026 Supporting Semantics-Based Transaction Processing in Mobile Database Applications Gary D. Walborn and Panos K. Chrysanthis Department of Computer Science University of Pittsburgh Pittsburgh, PA 15260
	ftp://cs.pitt.edu//panos/ACTA+/ACTA_TODS_94.ps.gz, 19951026 Synthesis of Extended Transaction Models using ACTA 1 Panos K. Chrysanthis Dept. of Computer Science University of Pittsburgh Pittsburgh, PA 15260 Krithi Ramamritham Dept. of Computer Science University of Massachusetts Amherst, MA 01003
	ftp://cs.pitt.edu//arch1/trace/proposal/prps.ps, 19951101 CS2541 TERM PROJECT Instructor : Dr. Henry Chuang TA: Yuhua Luo Due Date: Nov. 27, 1995 Problem Statement In this assignment, you are going to complete the kernel part of a cache simulator to evaluate the effects of cache size, cache block size, replacement policy, fetch policy, associativity and write
	ftp://cs.pitt.edu//http/htdocs/GrEdu/prelims-info/algorithm_prelim_96a.ps, 19951115 Algorithms Preliminary Exam University of Pittsburgh Computer Science Department Fall 1995 1. (10 points) Define the linear programming problem. 2. (10 points) Explain how and why the Bellman-Ford single source shortest path algorithm works. What is the running time of the Bellman-Ford algorithm What is
	ftp://cs.pitt.edu//http/htdocs/GrEdu/prelims-info/lang_prelim_Sept95.ps, 19951115 Preliminary Exam in Programming Languages September, 1995 Directions: You are to answer all of the following questions. Your answers should be legible and syntactically correct. Please start each answer on a new page. You should note that some questions are intentionally open ended. You should avoid
	ftp://cs.pitt.edu//realtime/s1.ps, 19951119 A Short Latex Course Daniel Moss e Department of Computer Science University of Pittsburgh Pittsburgh, PA 15260 1 Outline Assumes previous knowledge of the printing commands for ps files; plain text editor that can save files in text (ASCII) format; and drawing tools (idraw, xfig) that outputs ps files
	ftp://cs.pitt.edu//chang/obm.ps.Z, 19951207 An Object-Based Model for Dependable Real-Time Distributed Systems Yeong-Jia Chen Daniel Moss e Shi-Kuo Chang Department of Computer Science University of Pittsburgh, Pittsburgh, PA 15260 Phone: (412) 624-8836; FAX: (412) 624-8854 fchang,yjchen,mosseg@cs.pitt.edu December 5, 1995
	ftp://cs.pitt.edu//panos/PMDBnet/mmcn_96.ps.gz, 19951222 A Framework for Experimenting with QoS for Multimedia Services Deming Chen, Regis Colwell, Herschel Gelman, Panos K. Chrysanthis and Daniel Moss e University of Pittsburgh, Department of Computer Science Pittsburgh, Pennsylvania 15260
	ftp://cs.pitt.edu//realtime/transient-rt-ft.ps.gz, 19951223 Enhancing Real-Time Schedules to Tolerate Transient Faults Sunondo Ghosh, Rami Melhem, Daniel Moss e Department of Computer Science, University of Pittsburgh, Pittsburgh PA 15260 fghosh,melhem,mosseg@cs.pitt.edu
	ftp://cs.pitt.edu//realtime/vnet-sim.ps.gz, 19951223 Simulation of V net, a Versatile Network Architecture for Real-time and Non-Real-Time Traffic Brian Field U S WEST Technologies 4001 Discovery Drive, Suite 280 Boulder, CO 80303 bfield@advtech.uswest.com Daniel Moss e , Taieb Znati Department of Computer Science University of Pittsburgh Pittsburgh, PA
	ftp://cs.pitt.edu//chang/vl95.ps.Z, 19960113 1995 IEEE Symposium on Visual Languages, Sept. 5-9, Darmstadt, Germany 140 A Framework of a Visual Language with Dynamic Specification Jun'ichi Miyao Shi-Kuo Chang Faculty of Integrated Arts and Sciences Department of Computer Science Hiroshima University University of Pittsburgh Higashi-Hiroshima, 739,
	ftp://cs.pitt.edu//ISL/papers/aronis-buchanan-lee-96.ps, 19960119 Augmenting Medical Databases with Domain Knowledge John M. Aronis, Bruce G. Buchanan, and Seok Won Lee Department of Computer Science, University of Pittsburgh, Pittsburgh, PA 15260 In AAAI Spring Symposium on Artificial Intelligence in Medicine Stanford University, March 25-27, 1996 1. Introduction. In
	ftp://cs.pitt.edu//csim/csim-manual.ps, 19960131 March 13, 1990 CSIM Reference Manual (Revision 14) Herb Schwetman Microelectronics and Computer Technology Corporation 3500 West Balcones Center Drive Austin, TX 78759 (512) 338-3428 How to Read This Document This Reference Manual documents all aspects of the user interface to CSIM. It is fairly terse
	ftp://cs.pitt.edu//panos/QBI/dapd_96.ps.gz, 19960210 , , 1{23 () c Kluwer Academic Publishers, Boston. Manufactured in The Netherlands. Supporting Mobile Database Access through Query by Icons ANTONIO MASSARI massari@infokit.dis.uniroma1.it Dipart. di Informatica e Sistemistica, University of Rome "La Sapienza", 00198 - Roma, Italy SUSAN WEISSMAN, PANOS
	ftp://cs.pitt.edu//panos/MDBS/comad_94.ps, 19960221 Autonomy Requirements in Heterogeneous Distributed Database Systems 1 Panos K. Chrysanthis , Krithi Ramamritham Dept. of Computer Science, University of Pittsburgh, Pittsburgh, PA 15260 Dept. of Computer Science, University of Massachusetts, Amherst, MA 01003
	ftp://cs.pitt.edu//simsymp29/Urbina.ps, 19960226 A Framework for Symbolic Simulation of Hybrid Systems in Constraint Logic Programming Luis Urbina Department of Computer Science, University of Rostock, Albert Einstein Str. 21, D{18051 Rostock, Germany Email address : lurbina@informatik.uni{rostock.de
	ftp://cs.pitt.edu//realtime/compact-graphs.ps.gz, 19960305 Real-Time Scheduling Using Compact Task Graphs Rajiv Gupta Daniel Moss e Richard Suchoza fgupta,mosseg@cs.pitt.edu Department of Computer Science University of Pittsburgh Pittsburgh, PA 15260
	ftp://cs.pitt.edu//http/htdocs/GrEdu/prelims-info/programming_languages.ps, 19960513 Preliminary Examination Syllabus in Programming Languages May, 1996 A graduate student is expected to have a thorough knowledge of issues in programming language design and implementation. The student should be able to discuss language design from the orthogonal view points of individual languages.
	ftp://cs.pitt.edu//http/htdocs/GrEdu/dept-regulations.ps, 19960715 Department of Computer Science Regulations for Graduate Studies 1996-1997 1 Contents 1 Goals of the Graduate Program 3 2 Academic Standing 4 2.1 Graduate Admission Status : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 4 2.1.1 Full Graduate Status : : : : : : : : : : : : : : : : : : : :
	ftp://cs.pitt.edu//ISL/papers/world.ps, 19960724 The WoRLD: Knowledge Discovery from Multiple Distributed Databases John M. Aronis Department of Computer Science University of Pittsburgh, Pittsburgh, PA 15260 aronis@cs.pitt.edu Venkateswarlu Kolluri Department of Information Science University of Pittsburgh, Pittsburgh, PA 15260 venkat@lis.pitt.edu
	ftp://cs.pitt.edu//http/htdocs/GrEdu/prelims-info/lang_prelim_Jan96.ps, 19960802 Preliminary Exam in Programming Languages January, 1996 Directions: You are to answer all of the following questions. Your answers should be legible and syntactically correct. Please start each answer on a new page. You should note that some questions are intentionally open ended. You should avoid
	ftp://cs.pitt.edu//panos/PMDBnet/pdcs_96_iyv.ps.gz, 19960808 The Implicit{Yes Vote Commit Protocol with Delegation of Commitment Yousef J. Al-Houmaily Panos K. Chrysanthis Dept. of Electrical Engineering Dept. of Computer Science University of Pittsburgh University of Pittsburgh Pittsburgh, PA 15261 Pittsburgh, PA 15260
	ftp://cs.pitt.edu//ISL/papers/lentini-1996.ps, 19960813 Extending Parallel RL to Handle Large Data Sets Containing Numeric Data Types Russell P. Lentini Computer Science Department University of Pittsburgh Pittsburgh, PA 15260 lentini@cs.pitt.edu
	ftp://cs.pitt.edu//panos/PMDBnet/pdcs_95.ps, 19960917 Two-Phase Commit in Gigabit-Networked Distributed Databases Yousef J. Al-Houmaily Panos K. Chrysanthis Dept. of Electrical Engineering Dept. of Computer Science University of Pittsburgh University of Pittsburgh Pittsburgh, PA 15261 Pittsburgh, PA 15260
	ftp://cs.pitt.edu//znati/WANs/MPEG.ps.Z, 19960923 Compression Schemes MPEG g Moving Picture Experts Group (MPEG) (ISO 11172) g MPEG Objectives b Create an international standard that combines digital video data, digital audio data, and timing into a single sequential data stream b The data is compressed to create acceptable video and audio performance
	ftp://cs.pitt.edu//znati/WANs/hw2.ps.Z, 19960924 University of Pittsburgh hhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhh Department of Information Science Telecommunication Homework 2 (Due Date: October 1, 1996) (Q1.a)Suppose the Web contains 10 million pages, each with an average of 10 hyperlinks. Fetching a page
	ftp://cs.pitt.edu//znati/DOS/LBA-I.ps.Z, 19960926 Processor Allocation and Scheduling in Distributed Systems g System Models g Load Sharing g Load Balancing g Load Balancing Algorithms Dr. Taieb Znati Pitt CS(Tele) LBA 2 DOS System Models g Workstation model g Processor pool model g Hybrid model Dr. Taieb Znati Pitt CS(Tele) LBA 3 DOS System Models g
	ftp://cs.pitt.edu//http/htdocs/GrEdu/prelims-info/algorithm_prelim_96b.ps, 19960927 Algorithms Preliminary Exam University of Pittsburgh Computer Science Department Fall 1996 1. (10 points) Give a linear time comparison-based algorithm for building a standard binary heap given n unsorted integers. Make sure to justify that your algorithm runs in linear time. 2. (10 points) Show that
	ftp://cs.pitt.edu//http/htdocs/GrEdu/prelims-info/lang_prelim_Sept96.ps, 19960927 Preliminary Exam in Programming Languages September, 1996 Directions: You are to answer all of the following questions. Your answers should be legible and syntactically correct. Please start each answer on a new page. You should note that some questions are intentionally open ended. You should avoid
	ftp://cs.pitt.edu//znati/WANs/hw1-sol.ps.Z, 19960929 CS-TelCom - Homework 1 Solutions 1. Network Structure Network topology is linear in both papers- Fixed number of nodes in the Kummerle paper can be extended to match the variable number of nodes in the Miyahara paper. Fixed routing is assumed - node A communicates with node B via intermediate nodes.
	ftp://cs.pitt.edu//znati/WANs/FR.ps.Z, 19960929 Frame Relay g Frame Mode Bearer Service (FMBS), or Frame Relay, is a new form of data networking b Forward data elements (frames) between source and destination without applying internal error detection or correction g ITU-T Recommendations on Frame Relay b I.122 : Framework for Frame Mode Bearer
	ftp://cs.pitt.edu//csim/doc/csim-doc.ps, 19961002 March 13, 1990 CSIM Reference Manual (Revision 14) Herb Schwetman Microelectronics and Computer Technology Corporation 3500 West Balcones Center Drive Austin, TX 78759 (512) 338-3428 How to Read This Document This Reference Manual documents all aspects of the user interface to CSIM. It is fairly terse
	ftp://cs.pitt.edu//znati/DOS/rfc1119.ps.Z, 19961008 Status of this MemoThis document describes the Network Time Protocol (NTP), specifies its formal structure ands ummarizes information useful for its implementation. NTP provides the mechanisms tosynchronize time and coordinate time distribution in a large, diverse internet operating at rates frommundane
	ftp://cs.pitt.edu//znati/DOS/Mutex.ps.Z, 19961010 Mutual Exclusion Problem g Several processes, operating in parallel, compete for resources that cannot be shared, i.e., can only be accessed within a critical section b Constraints have to be applied to ensure that one process is exclusively using the resource at any point in time g A message based
	ftp://cs.pitt.edu//znati/DOS/Synch-I.ps.Z, 19961010 Synchronization in Distributed Systems Time, and Coordination of Events Physical Clock Synchronization Logical Clock Synchronization Dr. Taieb Znati Pitt CS(Tele) Synch 2 DOS Synchronization in Distributed Systems g Synchronization refers to achieving a common notion of time among a set of processes g
	ftp://cs.pitt.edu//znati/DOS/Synch-II.ps.Z, 19961010 Logical Time g Fundamental observations can be made regarding clock synchronization and ordering of events in a distributed system b Clock synchronization need not be absolute ` If two processes do not interact with each other, they need not be concerned with clock synchronization b It does not matter
	ftp://cs.pitt.edu//znati/DOS/ds-intro.ps.Z, 19961011 Distributed Systems g A distributed system is a set of hosts connected by a communication network designed to allow several users to cooperate together g Characteristics b Separation b Transparency Dr. Taieb Znati DS 2 Separation g Inherent property of distributed systems g Separation allows : b True
	ftp://cs.pitt.edu//znati/DOS/Case-Study.ps.Z, 19961011 Client-Server Message Based Communication g Message passing primitives can be characterized as : b Blocking or Nonblocking b Buffered or Unbuffered b Reliable or Unreliable CS/Telcom Dr. Taieb Znati DS IPC 2 Message Based Communication Blocking Primitives g Blocking primitives are also referred to as
	ftp://cs.pitt.edu//znati/WANs/test-sample.ps.Z, 19961011 Fall '97-2 TeleCom 2108/CS 2520 Sample Test Student Name: Q.1 (20pts) Total Q.2 (20 pts)Q.3 (20 pts)Q.5 (25 pts)Q.4 (15 pts) 1 1. A communication system is characterized by a packet length, L, an average number of hops, N , and a bit error rate, e. (a) Compute the probability, p, that a packet
	ftp://cs.pitt.edu//znati/WANs/hw2-Sol.ps.Z, 19961011 University of Pittsburgh hhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhh Department of Information Science Telecommunication Homework 2 Solution (A1.a)This question depends on your interpretation of "indexing". If you took indexing to mean any page in the web, the time
	ftp://cs.pitt.edu//znati/DOS/IPC.ps.Z, 19961011 DS Communication Protocols g The fundamental purpose of communication in distributed systems is to exchange Information between processes. b Information is represented as data and carries meaning currently assigned to those data. ` Data represents facts, concepts, or instructions in a formalized manner
	ftp://cs.pitt.edu//znati/WANs/SMDS-I.ps.Z, 19961014 What is SMDS ``SMDS is a high speed, connectionless, wide area, cell relay, fast packet public switch data networking service'' Computer Science Department Dr. Taieb Znati University of Pittsburgh SMDS 2 SMDS Network Architecture Router Router Network Interface Subscriber (SNI) Interconnect Carrier
	ftp://cs.pitt.edu//znati/WANs/SMDS-II.ps, 19961019 SMDS 37 SIP Level 2 g Performs framing of the Level 3 PDU for serial transmission across SNI b Fixed length slots are generated by this layer Computer Science Department Dr. Taieb Znati University of Pittsburgh SMDS 38 SIP Level 2 PDU bits Payload PayloadNetwork Control Access TrailerHeader 8 32 2
	ftp://cs.pitt.edu//znati/WANs/DQDB.ps, 19961019 DQDB 1 DQDB Topology Unidirectional Bus A Unidirectional Bus B Head of Bus B Head of Bus A Configuration Diagram Logical Diagram : Head-End, responsible for slot generation functions Computer Science Department Dr. Taieb Znati University of Pittsburgh DQDB 2 DQDB Node Architecture Access Unit Read Shift
	ftp://cs.pitt.edu//znati/DOS/Election.ps, 19961020 Election Algorithms g Many distributed algorithms rely on a the functionalities of a coordinator b In case of a failure, a new coordinator has to be elected g One approach is to elect the process with the highest Id value g The objective is to determine the new coordinator, while allowing any number of
	ftp://cs.pitt.edu//znati/DOS/Deadlock-I.ps, 19961020 Algorithms For Detection And Resolution of Deadlocks In Distributed Systems g Problem definition g Classes of deadlock algorithms g Model for resource allocations g Deadlock algorithms Dr. Taieb Znati Pitt CS(Tele) Deadlock 2 DOS Deadlock Problem g Deadlock is a major problem in any system where
	ftp://cs.pitt.edu//znati/WANs/project.ps, 19961024 Spring '96-2 CS-2520/TelCom2108- High Speed WANs Tuesday 3:00 PM - 5:50 PM 228, Alumni Hall Dr. Taieb Znati (znati@cs.pitt.edu) 226, Alumni Hall Tel: 624-8417 Project Description 1 Objective Recent advances in VLSI technology led to the development of high speed networks. These network architectures
	ftp://cs.pitt.edu//znati/WANs/ATM-1.ps, 19961029 Outline g B-ISDN Architecture Overview g B-ISDN Physical Layer b SONET g ATM Adaptation Layers g ATM Switching g ATM Flow Control and Traffic Management g ATM Connection Admission Control and Management g Internetworking with ATM CS/Telecom Dr. Taieb Znati Fall 96 ATM 2 B-ISDN Principles g B-ISDN
	ftp://cs.pitt.edu//realtime/ghosh-diss.ps.gz, 19961103 GUARANTEEING FAULT TOLERANCE THROUGH SCHEDULING IN REAL-TIME SYSTEMS by Sunondo Ghosh B.Tech., Banaras Hindu University (IT-BHU), India, 1991 M.S., University of Pittsburgh, 1993 Submitted to the Graduate Faculty of Arts and Sciences in partial fulfillment of the requirements for the degree of Doctor of
	ftp://cs.pitt.edu//znati/WANs/ATM-2.ps, 19961105 ATM Transport Hierarchy g To provided a connection oriented, cell based service, ATM uses a hierarchy of functions b Support for internal network functions b Support for user-network functions CS/Telecom Dr. Taieb Znati Fall 96 ATM 70 ATM Transport Hierarchy Virtual Channel Level Virtual Path Level
	ftp://cs.pitt.edu//Admissions/form.ps, 19971003 Application for Admission to Graduate Study Faculty of Arts and Sciences at the University of Pittsburgh Send all application materials to the Graduate Admissions Officer for your proposed major department at the University of Pittsburgh, Pittsburgh, Pennsylvania, 15260. Enclose an application fee of
	ftp://cs.pitt.edu//Admissions/info.ps, 19971008 Admission to Graduate Study An undergraduate degree is the minimal requirement for admission to graduate study. Students are admitted to a graduate program in one of the following three types of status: 1. Full graduate status: when all admission requirements are met, 2. Provisional graduate status:
	ftp://cs.pitt.edu//Admissions/letter.ps, 19971015 PITT 2104 (0594) Office of Graduate Admissions Reference DEPARTMENT OF COMPUTER SCIENCE Form UNIVERSITY OF PITTSBURGH Pittsburgh, PA 15260 APPLICANT Fill in the blanks in this section and submit the form to a person, preferably a current or former professor, who can evaluate your potential for graduate
	ftp://cs.pitt.edu//Admissions/profile.ps, 19971015 Supplemental Information Form Computer Science Department Name: hhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhh Date: hhhhhhhhhhh Address: hhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhh City: hhhhhhhhhhhhhhhhhhhhhhhhhhhhhhh State: hhhhhhhhhhhhhhhhhhhhh Country: hhhhhhhhhhhhhhhhhhhhhhhhhhhh
	ftp://cs.pitt.edu//Admissions/foreign.ps, 19971015 Additional Information and Procedures for Foreign Applicants G Submit original or certified (notarized) copies of all original language academic records/mark sheets/transcripts from all postsecondary institutions attended. Where the official original documents are issued in a language other than