Main Page
About Us
Overview
Introduction
Historical Timeline
Vision and Mission
Departments and Degree Programs
KAU Engineering Research
Excellence
Dean's Award
ABET Accreditation
ISO Certificate
Deanships
Dean
Dean's Message
Former Deans
Vice Deans
Vice Dean
Vice Dean for Graduate
Vice Dean for Development
Vice Dean for Female Branch
Administration
Organization Chart
Faculty Administration Unit
Information Unit
Technical Support Unit
Facilities Unit
Admissions
KAU Admissions Requirements
KAU Engineering Admissions Requirements
KAU Engineering Graduate Studies
Student Services
Undergraduate Study & Examination Bylaw
Student Bylaw - Rights and Duties
Courses
Frequently questions
Departments
Alumni
Academic Support Units
Academic Affairs Unit (AAU)
Training Unit (TU)
Accreditation Support Unit (ASU)
Industrial and International Relations Unit (IIRU)
Facilities
Technical Support Unit
Diploma of Safety and Fire Protection
To Communicate
Contact Us
Find Us
Photo Album
عربي
English
About
Admission
Academic
Research and Innovations
University Life
E-Services
Search
Faculty of Engineering
Document Details
Document Type
:
Article In Journal
Document Title
:
Aggregation/Disaggregation Methods for Computing the Stationary Distribution of Markov Chains with Application to Multiprogramming System
الطرق التبسيطية والتجميعية لحساب التوزيع الاحتمالي المتقر لسلاسل ماركوف مع التطبيق على حاسب آلي متعدد البرامج
Subject
:
Computer Engineering
Document Language
:
English
Abstract
:
This paper studies the aggregation/disaggregation of nearly completely decomposable Markov chains that have many applications in queueing networks and packet switched networks. A general class of similarity transformation that transforms the stochastic transition probability matrix into a reduced order aggregated matrix is presented. This transformation is used to develop an aggregation algorithm to compute the exact stationary probability distribution, as weB as O( ek ) approximation of it. The proposed aggregation method is applied to a multiprogramming computer system with six active terminals and the capacity of the CPU and the secondary memory is 3. This example is used to compare our algorithm with three well-known algorithms. The simulation studies showed that our algorithm usually converges in less number of iterations and CPU time. Moreover, it is shown that the other algorithms do not converge in some cases while our algorithm usually converges.
ISSN
:
1319-1047
Journal Name
:
Engineering Sciences Journal
Volume
:
6
Issue Number
:
1
Publishing Year
:
1414 AH
1994 AD
Article Type
:
Article
Added Date
:
Tuesday, January 5, 2010
Researchers
Researcher Name (Arabic)
Researcher Name (English)
Researcher Type
Dr Grade
Email
رباح واصل الظاهري
ALDHAHERI, RABAH WASEL
Researcher
Doctorate
Files
File Name
Type
Description
24680.pdf
pdf
Aggregation/Disaggregation Methods for Computing the Stationary Distribution of Markov Chains with Application to Multiprogramming System
Back To Researches Page