Minimizing replica idle time

Almhanna, Mahdi S.

doi:10.1109/ntict.2017.7976134

Cited by 5 publications

(8 citation statements)

References 14 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Step 11: Apply Pincer Search Algorithm for Support (100% & 90%) Input : LHF ( 7 ,S 8 } has been neglected using score criteria as it is shown in the list of sites of MFS (Score) As shown in Figure 6.…”

Section: Belowmentioning

confidence: 99%

“…The transferring process could be done using the file transfer service Grid FTP or UDT as shown in Figure 1 below. Data mining approach was used in our previous work [1,2,3,4,5,7] to identify a set of associated sites. In the current work, we have improved the following: 1-Improving Selecting Score.…”

Section: Introductionmentioning

confidence: 99%

“…In the current work, we have improved the following: 1-Improving Selecting Score. In the current work selecting score has been expanded to enhance the performance of selection of the previous work [1,2,3,4,5,7]. Additional factors are imbedded to the selection criteria equation such as: bandwidth, CPU load and availability of memory factors.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Promote Replica Management based on Data Mining Techniques

Almuttairi¹,

Almhanna²,

Mohammed³

et al. 2018

IJET

View full text Add to dashboard Cite

The data grid technique evolved largely in sharing the data in multiple geographical stations across different sites to improve the data access and increases the speed of transmission data. The performance and the availability of the resources is taken into account, when a total of sites holding a copy of files, there is a considerable benefit in selecting the best set of replica sites to be cooperated for increasing data transfer job. In this paper, new selecrtion strategy is proposed to reduce the total transfer time of required files. Pincer-Search algorithm is used to explore the common characteristics of sites to select uncongested replica sites.

show abstract

Section: Belowmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Promote Replica Management based on Data Mining Techniques

Almuttairi¹,

Almhanna²,

Mohammed³

et al. 2018

IJET

View full text Add to dashboard Cite

show abstract

“…Based on the current tra c characteristics and by using a xed weight for a weighted round-robin at the start of each base station round the weight of each queue in different categories is dynamically guessed. There are many di culties in designing a system to control congestion which causes signi cant delays in data transmission which usually lead result in a mismatch between network resources and acceptable tra c. Accordingly, it is necessary to adopt all or at least most of the characteristics that will be the main reason for affecting the amount of data transfer in the network, such as bandwidth, bit rate, processing speed and attempts to use some processors to reduce CPU idle time [9], [10].…”

Section: Introductionmentioning

confidence: 99%

Dynamic Weight Assignment with Least Connection Approach for Enhanced Load Balancing in Distributed Systems

Almhanna

Murshedi

Al-Turaihi

et al. 2023

Preprint

View full text Add to dashboard Cite

Load balancing is a critical aspect of managing server resources efficiently and ensuring optimal performance in distributed systems. The Weighted Round Robin (WRR) algorithm is commonly used to allocate incoming requests among servers based on their assigned weights. However, static weights may not reflect the changing demands of servers, leading to imbalanced workloads. To address this issue, this study proposes a dynamic mechanism for assigning weights to servers in the WRR algorithm based on the data rate and incorporates the Least Connection approach for the best result. The dynamic mechanism takes into account the real-time data rate of each server, representing its current load. Servers with higher data rates are assigned higher weights to attract a larger share of incoming requests, while those with lower data rates receive lower weights to manage their loads effectively. This dynamic weight assignment allows the algorithm to adapt to varying workloads and achieve better load balancing across servers. To further refine the distribution of requests, the Least Connection approach is employed to handle tie-breaking situations and for more fairness in distributing the loads. The proposed algorithm is a hybrid of data rate and the Least Connection, it is evaluated through simulations and real-world experiments. The results demonstrate its superiority in achieving improved load balance compared to traditional static-weight WRR algorithms. By dynamically adjusting weights based on data rate and employing the Least Connection approach, the algorithm optimizes server resource usage, minimizes response times, and enhances overall system performance in distributed environments.

show abstract

“…When the database saves on multiple sites across various locations, it's called distributed database [2], this database stores in multiple computers existing on the same sites, or it can share through a network of computers connected to each other [2], [3]. This system comprises a database distributed over unrelated sites with some [4], [5] because it does not share any of the physical system components. Administrators can have control over these databases, as they can distribute sets of similar data through the replication process, or even sets of different data, and in both cases, this can by distributing them to multiple physical sites on network servers or decentralized computers on the internet, such as by allowing tasks to be performed on multiple devices and end-user performance can have improved by using distributed databases [6].…”

Section: Introductionmentioning

confidence: 99%

Reducing waiting and idle time for a group of jobs in the grid computing

Almhanna¹,

Al-Turaihi²,

Murshedi³

2023

Bulletin EEI

View full text Add to dashboard Cite

Johnson's rule is a scheduling method for the sequence of jobs. Its primary goal is to find the perfect sequence of functions to reduce the amount of idle time, and it also reduces the total time required to complete all functions. It is a suitable method for scheduling the purposes of two functions in a specific time-dependent sequence for both functions and where the time factor is the only parameter used in this way. Therefore, it is not suitable for scheduling work for computers network, where there are many factors affecting the completion time such as CPU speed, memory, bandwidth, and size of data. In this research, Johnson's method will adopt by adding many factors that affect the completion time of the work so that it becomes suitable for the site’s job scheduling purposes to reduce the waiting and idle time for a group of jobs.

show abstract

Minimizing replica idle time

Cited by 5 publications

References 14 publications

Promote Replica Management based on Data Mining Techniques

Promote Replica Management based on Data Mining Techniques

Dynamic Weight Assignment with Least Connection Approach for Enhanced Load Balancing in Distributed Systems

Reducing waiting and idle time for a group of jobs in the grid computing

Contact Info

Product

Resources

About