Normal view MARC view ISBD view

Modification of traditional bully algorithm using priority queuing technique applied in CPU memory allocation. 6

By: Richelle Rose R. Alcaide, Saimon C Rumol. 4 0 16, [, ] | [, ] |

Contributor(s): 5 6 [] |

Language: Unknown language code Summary language: Unknown language code Original language: Unknown language code Series: ; 4541346Edition: Description: 28 cm. viii, 67 ppContent type: text Media type: unmediated Carrier type: volumeISBN: ISSN: 2Other title: 6 []Uniform titles: | | Related works: 1 40 6 []Subject(s): -- 2 -- 0 -- -- | -- 2 -- 0 -- 6 -- | 2 0 -- | -- -- 20 -- | | -- -- -- -- 20 -- | -- -- -- 20 -- --Genre/Form: -- 2 -- Additional physical formats: DDC classification: | LOC classification: | | 2Other classification:

Contents:

Action note: In: Summary: ABSTRACT: A classic difficulty in distributed system applications is leader election. The Bully Algorithm is a leader-election algorithm that has a straightforward procedure in which every process that is active is listed in the system and selects the one with the highest ID to serve as the coordinator. The Bully Algorithm is observed to have costly consumption of time and memory along with numerous instances of failed nodes receiving data. The study aims to modify the traditional Bully Algorithm to reduce the communication cost, reduce the time consumption, and to minimize the instances of sending data to a failed node when utilizing the algorithm. Priority Queuing will organize active nodes in descending order based on their active status, with the election message sent only to the highest-ranked node in the queue. The study intends to compare the performances of three variations of Bully Algorithm (which are the Traditional Bully Algorithm, the latest enhancement, and the proposed modification) using a simulator that ensures the algorithms share the exact same data set. The findings show that the proposed modification trumps over the latest enhancement only during an increased presence of inactive nodes in the distributed system. In return, the latest enhancement trumps over the proposed modification when there are little to no presence of inactive nodes. The study has successfully modified the traditional Bully Algorithm using Priority Queuing to reduce these aforementioned issues when utilizing the algorithm. This improved algorithm can efficiently coordinate resource management in cloud computing environments, facilitate data replication, and coordinate consensus mechanisms in blockchain networks. Other editions:

Tags from this library: No tags from this library for this title. Log in to add tags.

Average rating: 0.0 (0 votes)

Holdings ( 1 )
Title notes
Comments ( 0 )

Item type	Current location	Home library	Collection	Call number	Status	Date due	Barcode	Item holds
Book	PLM	PLM Filipiniana Section	Filipiniana-Thesis	QA76.9.C643 .A43 2024 (Browse shelf)	Available		FT7858

Total holds: 0

Browsing PLM Shelves , Shelving location: Filipiniana Section , Collection code: Filipiniana-Thesis Close shelf browser

Previous	No cover image available	No cover image available	No cover image available	No cover image available	No cover image available	No cover image available	No cover image available	Next
Previous	QA76.9 A43 T36 2025 Enhanced macqueen’s algorithm for identifying diverse crime patterns in the City of Manila	QA76.9 A73 S47 2025 Modified support vector machine algorithm for text classification applied psychiatric tele-triage	QA76.9 B67 2016 An enhancement of the Boyer-Moore Algorithm applied in braille translation /	QA76.9.C643 .A43 2024 Modification of traditional bully algorithm using priority queuing technique applied in CPU memory allocation.	QA76.9 Es3 2018 An enhancement of genetic algorithm applied in courier vehicle routing /	QA76.9 N38 A44 2025 An enhancement of fuzzy support vector machine using natural language processing model applied on online product reviews	QA76.9 N38 M34 2025 Enhancement of Bert model with predictive text generation and attention mechanisms for improvements in text autocomplete	Next

Undergraduate Thesis: (Bachelor of Science in Computer Science) - Pamantasan ng Lungsod ng Maynila, 2024. 56

ABSTRACT: A classic difficulty in distributed system applications is leader election. The Bully Algorithm is a leader-election algorithm that has a straightforward procedure in which every process that is active is listed in the system and selects the one with the highest ID to serve as the coordinator. The Bully Algorithm is observed to have costly consumption of time and memory along with numerous instances of failed nodes receiving data. The study aims to modify the traditional Bully Algorithm to reduce the communication cost, reduce the time consumption, and to minimize the instances of sending data to a failed node when utilizing the algorithm. Priority Queuing will organize active nodes in descending order based on their active status, with the election message sent only to the highest-ranked node in the queue. The study intends to compare the performances of three variations of Bully Algorithm (which are the Traditional Bully Algorithm, the latest enhancement, and the proposed modification) using a simulator that ensures the algorithms share the exact same data set. The findings show that the proposed modification trumps over the latest enhancement only during an increased presence of inactive nodes in the distributed system. In return, the latest enhancement trumps over the proposed modification when there are little to no presence of inactive nodes. The study has successfully modified the traditional Bully Algorithm using Priority Queuing to reduce these aforementioned issues when utilizing the algorithm. This improved algorithm can efficiently coordinate resource management in cloud computing environments, facilitate data replication, and coordinate consensus mechanisms in blockchain networks.

There are no comments for this item.

to post a comment.