Adaptive RS-group scheduling for WiMAX multihop relay

Saeed, Rashid A.; Al-Talib, Sahar Abdul Aziz; Ahdal, Tariq A. Al; Mohamad, Hafizal; Abbas, Muhammad; Ali, Borhanuddin Mohd; Odeh, Nidhal

doi:10.1109/iccce.2010.5556791

Cited by 4 publications

(3 citation statements)

References 8 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Recently, many new sophisticated and complex applications with high resources and computation need i.e., nanotechnologies, machine learning, nuclear energy etc. [1]. Grid systems are technique and mechanism for computation resources sharing and utilization in a distribution manner that can provide highly efficient services for distributed and parallel systems that allows the share, select, aggregate and distribute computation resources for several organizational zones based on their capability, availability, cost, performance and users' quality of services (QoSs) required [2].…”

Section: Introductionmentioning

confidence: 99%

Scheduling Algorithm for Grid Computing Using Shortest Job First with Time Quantum

Yosuf¹,

Mokhtar²,

Saeed³

et al. 2022

Intelligent Automation &Amp; Soft Computing

View full text Add to dashboard Cite

The grid computing is one of the strong initiatives and technologies that has been introduced in the last decade for improve the resources utilization, optimization and provide very high throughput computation for wide range of applications. To attain these goals an effective scheduling for grid systems is a vital issue to realize the intended performance. The processes scheduling could be executed in various methods and protocols that have been extensively address in the literature. This works utilized shortest process first (SPF) protocol which gives the shortest jobs the highest priorities. For longer jobs, it should have lower priorities and wait in the queue longer time. With too many smallest tasks reach the queue, the long tasks can't have an opportunity to be processed and the number of tasks continue growing in front of them, which is well-known issue called Starvations. In this work we introduce a new time quantum-based for shortest process first to avoid the starvation problem. The objective of the model is to optimize the utilization of resources by reducing end time of the job and enhancing performance of job scheduling. The model introduces fair treatment for all the processes. A simulation environment for the proposed model is developed and implemented. The results show that the quantum time-based solution has improved the starvation issues severely in terms of time delay, optimization of grid resources and fairness. The results show that SJF with time quantum outperform the SJF in terms of end time process, resources utilization, delay to transmission and Fair treatment for all the processes. But in term of waiting time Shortest Job First is better, SJF does not always minimize waiting time.

show abstract

Section: Introductionmentioning

confidence: 99%

Scheduling Algorithm for Grid Computing Using Shortest Job First with Time Quantum

Yosuf¹,

Mokhtar²,

Saeed³

et al. 2022

Intelligent Automation &Amp; Soft Computing

View full text Add to dashboard Cite

show abstract

“…The amendments are aimed to extend the coverage and improve the throughput of the WiMAX network without having to install expensive Base Station (BS) [3]. Apart from that, RS can also resolve the connectivity issues in single BS configuration [4,5].…”

mentioning

confidence: 99%

“…A BS in IEEE 802.16j MMR network must be able to communicate with RSs and support traffic aggregation from multiple RSs but as for the subscriber station (SS), conventional SS should be able to function normally in a multihop mobile configuration [3]. A basic IEEE 802.16 MMR WiMAX network consist of multi-hop relay-BS (MR-BS), one or more RS and the end user devices, the subscriber station (SS) which can be either fixed or mobile nodes [6].…”

mentioning

confidence: 99%