Cover Image

Investigating feasibility of queuing model to eliminate server deadlock: case of SPP (Patient Management System) / Rusyamimi Rosmanmi Rosman

The goal of transaction is to ensure that all of the objects managed by a server remain in a consistent state where, when they are accessed by multiple transactions and in the presence of server crashes or down. In any object that represents a shared resource in a distributed system, it must be resp...

Full description

Saved in:
Bibliographic Details
Main Author: Rosman, Rusyamimi
Format: Thesis
Language:English
Published: 2014
Subjects:
Application program interfaces
Neural networks (Computer science)
Online Access:https://ir.uitm.edu.my/id/eprint/66203/1/66203.pdf
https://ir.uitm.edu.my/id/eprint/66203/
Tags: Add Tag
No Tags, Be the first to tag this record!
id my.uitm.ir.66203
record_format eprints
spelling my.uitm.ir.662032022-09-14T09:08:57Z https://ir.uitm.edu.my/id/eprint/66203/ Investigating feasibility of queuing model to eliminate server deadlock: case of SPP (Patient Management System) / Rusyamimi Rosmanmi Rosman Rosman, Rusyamimi Application program interfaces Neural networks (Computer science) The goal of transaction is to ensure that all of the objects managed by a server remain in a consistent state where, when they are accessed by multiple transactions and in the presence of server crashes or down. In any object that represents a shared resource in a distributed system, it must be responsible in ensuring that it can operate correctly in a concurrent environment. Therefore, programmers should take concern in implementing any objects or processes which will not be intended to use in a distributed system so that it will stay safe in a concurrent environment. This is to avoid from any issue such as server deadlock to be happened. A deadlock occurs when two or more processes are waiting on the same resource and each of the process is waiting on the other process to complete before moving forward. Deadlock also is a particularly common situation when clients are involved in a program, for a transaction in the program may last for a long period of time. This may resulting in many objects being locked thus, preventing other client using them. When this kind of situation occurs, there will be no way for these processes to resolve the conflict. In this research, researcher will determined on the modules which has been provided by the stakeholder, which the three selected modules has high number of server deadlock occurrence. In completing this research project, researcher-tends to achieve two objectives here which are firstly, to identify server deadlock occurrence in three different modules in SPP. Then, researcher has decided to choose Queuing Model as the solution and second objective would be to investigate the feasibility of Queuing Model concept in solving or at least reducing current server deadlock problem. This research scope is the evaluation will only be done on three different modules which have been identified by the stakeholder, to have the most occurrence of server deadlock. Hopefully from this research contribution can helps stakeholder in reducing the occurrence of server deadlock as it occurs in a most crucial application system which is in health care information systems. For the future works, this research project can be extended by conducting an experimental research or simulation testing and implement the proposed M/M/l Markov Model to SPP. 2014 Thesis NonPeerReviewed text en https://ir.uitm.edu.my/id/eprint/66203/1/66203.pdf Investigating feasibility of queuing model to eliminate server deadlock: case of SPP (Patient Management System) / Rusyamimi Rosmanmi Rosman. (2014) Masters thesis, thesis, Universiti Teknologi MARA (UiTM).
institution Universiti Teknologi Mara
building Tun Abdul Razak Library
collection Institutional Repository
continent Asia
country Malaysia
content_provider Universiti Teknologi Mara
content_source UiTM Institutional Repository
url_provider http://ir.uitm.edu.my/
language English
topic Application program interfaces
Neural networks (Computer science)
spellingShingle Application program interfaces
Neural networks (Computer science)
Rosman, Rusyamimi
Investigating feasibility of queuing model to eliminate server deadlock: case of SPP (Patient Management System) / Rusyamimi Rosmanmi Rosman
description The goal of transaction is to ensure that all of the objects managed by a server remain in a consistent state where, when they are accessed by multiple transactions and in the presence of server crashes or down. In any object that represents a shared resource in a distributed system, it must be responsible in ensuring that it can operate correctly in a concurrent environment. Therefore, programmers should take concern in implementing any objects or processes which will not be intended to use in a distributed system so that it will stay safe in a concurrent environment. This is to avoid from any issue such as server deadlock to be happened. A deadlock occurs when two or more processes are waiting on the same resource and each of the process is waiting on the other process to complete before moving forward. Deadlock also is a particularly common situation when clients are involved in a program, for a transaction in the program may last for a long period of time. This may resulting in many objects being locked thus, preventing other client using them. When this kind of situation occurs, there will be no way for these processes to resolve the conflict. In this research, researcher will determined on the modules which has been provided by the stakeholder, which the three selected modules has high number of server deadlock occurrence. In completing this research project, researcher-tends to achieve two objectives here which are firstly, to identify server deadlock occurrence in three different modules in SPP. Then, researcher has decided to choose Queuing Model as the solution and second objective would be to investigate the feasibility of Queuing Model concept in solving or at least reducing current server deadlock problem. This research scope is the evaluation will only be done on three different modules which have been identified by the stakeholder, to have the most occurrence of server deadlock. Hopefully from this research contribution can helps stakeholder in reducing the occurrence of server deadlock as it occurs in a most crucial application system which is in health care information systems. For the future works, this research project can be extended by conducting an experimental research or simulation testing and implement the proposed M/M/l Markov Model to SPP.
format Thesis
author Rosman, Rusyamimi
author_facet Rosman, Rusyamimi
author_sort Rosman, Rusyamimi
title Investigating feasibility of queuing model to eliminate server deadlock: case of SPP (Patient Management System) / Rusyamimi Rosmanmi Rosman
title_short Investigating feasibility of queuing model to eliminate server deadlock: case of SPP (Patient Management System) / Rusyamimi Rosmanmi Rosman
title_full Investigating feasibility of queuing model to eliminate server deadlock: case of SPP (Patient Management System) / Rusyamimi Rosmanmi Rosman
title_fullStr Investigating feasibility of queuing model to eliminate server deadlock: case of SPP (Patient Management System) / Rusyamimi Rosmanmi Rosman
title_full_unstemmed Investigating feasibility of queuing model to eliminate server deadlock: case of SPP (Patient Management System) / Rusyamimi Rosmanmi Rosman
title_sort investigating feasibility of queuing model to eliminate server deadlock: case of spp (patient management system) / rusyamimi rosmanmi rosman
publishDate 2014
url https://ir.uitm.edu.my/id/eprint/66203/1/66203.pdf
https://ir.uitm.edu.my/id/eprint/66203/
_version_ 1744357261105430528
score 13.211869

Similar Items