Task Load Balancing Strategy for Grid Computing

Yagoubi, Belabbes; Slimani, Yahya

doi:10.3844/jcssp.2007.186.194

Cited by 121 publications

(111 citation statements)

References 9 publications

Supporting

Mentioning

110

Contrasting

Unclassified

Order By: Relevance

“…As explained earlier in [14], every SM collects the information of any PE joining or leaving the grid system and then transmits it to its parent LGM. This means that a processing element only needs a communication when joining or leaving its site.…”

Section: Load Balancementioning

confidence: 99%

See 1 more Smart Citation

An Entropic Optimization Technique in Heterogeneous Grid Computing Using Bionic Algorithms

M.Darwish¹,

A.El-zoghabi²,

F.Ashry³

2015

IJCSIT

View full text Add to dashboard Cite

show abstract

Section: Load Balancementioning

confidence: 99%

“…In [14], a hierarchical model of load distribution is introduced. It consists of a tree based Grid model together with three load balancing algorithms at various levels of the hierarchical model.…”

Section: Related Workmentioning

confidence: 99%

An Entropic Optimization Technique in Heterogeneous Grid Computing Using Bionic Algorithms

M.Darwish¹,

A.El-zoghabi²,

F.Ashry³

2015

IJCSIT

View full text Add to dashboard Cite

show abstract

“…The approach requires a copy of system agents on all the systems so that DLB agent may collect load information from these systems and perform load balancing. Yagoubi and Slimani [35] puts forward a dynamic tree based model to represent grid architecture and proposes Intra-site, Intracluster and Intra-grid load balancing. Nehraet.…”

Section: Related Workmentioning

confidence: 99%

A dynamic file replication based on CPU load and consistency mechanism in a trusted distributed environment

Vardhan

Kushwaha

2017

Teh. vjesn.

View full text Add to dashboard Cite

Original scientific paper An effort has been made to propose a CPU load based dynamic, cooperative, trust based, and secure file replication approach based along with consistency among file replicas for distributed environment. Simulation results consisting of 100 requesting nodes, three file servers and file size ranging from 677 KB to 11 MB establishes that, when the CPU load is taken into consideration, the average decrease in file request completion time is about 22,04 ÷ 24,81 % thus optimizing the CPU load and minimizing the file request completion time. The CPU load decreases by 4,25 ÷ 5,58 %. Results show that, the average write latency with proposed mechanism decreases by 6,12 % as compared to Spinnaker writes and the average read latency is 3 times better than Cassandra Quorum Read (CQR). The proposed partial update propagation for maintaining file consistency stands to gain up to 69,67 % in terms of time required to update stale replicas. Thus the integrity of files and behaviour of the requesting nodes and file servers is guaranteed within even lesser time. Finally, a relationship between the formal aspects of simple security model and secure reliable CPU load based file replication model is established through process algebra. Keywords Dinamička replikacija datoteke zasnovana na mehanizmu opterećenosti i konzistencije CPU u pouzdanom distribuiranom okruženjuIzvorni znanstveni članak Pokušalo se predložiti dinamički, kooperativni, pouzdani i sigurni pristup replikaciji datoteke utemeljen na opterećenosti CPU uz konzistenciju među replikama datoteke za distribuirano okruženje. Rezultati simulacije koja se sastoji od 100 potrebnih čvorova, tri servera datoteke i datoteke veličine od 677 KB to 11 MB pokazuju da kada se uzme u obzir opterećenje CPU, prosječno smanjenje vremena potrebnog za popunjavanje datoteke je oko 22,04 ÷ 24,81 %. Tako se optimiziralo opterećenje CPU i smanjilo traženo vrijeme popunjavanja datoteke. Opterećenje CPU smanjuje se za 4,25 ÷ 5,58 %. Rezultati pokazuju da se prosječno kašnjenje upisa (write latency) s predloženim mehanizmom smanjuje za 6,12 % u usporedbi sa Spinnakerovim, a prosječno vrijeme čekanja čitanja (read latency) je 3 puta bolje od Cassandra Quorum Read (CQR). Predložena parcijalna propagacija ažuriranja za održavanje konzistencije datoteke povećava se do 69,67 % u odnosu na vrijeme potrebno za ažuriranje zastarjelih replika. Tako je integritet datoteka i ponašanje zahtijevanih čvorova i servera datoteke zagarantirano za čak manje vremena. Konačno, kroz algebra postupak uspostavljen je odnos između formalnih aspekata jednostavnog modela sigurnosti i sigurnog pouzdanog modela replikacije datoteke zasnovanog na sigurnom pouzdanom opterećenju datoteke.

show abstract

“…As more organizations and users are becoming interested in using grid computing systems in a variety of application domains, security becomes a key issue (Simmons et al, 1991;Stell, 2004;Welch et al, 2003;Yagoubi and Slimani, 2007). Public Key Infrastructure assumes a pre-agreed trust between the service provider and the service consumer.…”

Section: Introductionmentioning

confidence: 99%

A Stringent Authorization using Principles and Policy for Grid Computing

Jayasudha¹,

Purusothaman²

2011

Journal of Computer Science

View full text Add to dashboard Cite

Problem statement:The current information security mechanisms are insufficient to address authorization issues. The access control models today are mostly static and they are not wellsuited for the service-oriented environments where information access is dynamic in nature. Traditional authorization security techniques do not directly address these concerns as they primarily use access control lists for authorization, where the user whose name appears in the list is authorized to access the grid with some privileges associated with the names, which requires the resource provider to maintain authorization decisions for every user, which is very time consuming and non-scalable solution. Approach: Organizations pass user roles instead of name and date of birth but it used Public Key Infrastructure user certificate for authorization which is inflexible when it comes to open distributed systems (Grid) as it assumes a pre-agreed trust between Service Provider and the Service consumer. Usage of Java authentication and authorization services is performed in a pluggable fashion. It permits the application to remain independent from underlying authentication technology. Results: Our implementation provides service providers with full control over authentication and authorization of accounts that access services. Implementation of the proposed technique has proved to be less time consuming and more secured for authentication and authorization as compared to the traditional way of authenticating the users. The Policy Decision Service is envisioned to be used by many Web services protected by their PEPs. Conclusion: The model brings out many advantages over traditional identity. It is more flexible and more powerful and is suited for dynamic environments for Web services.

show abstract

Task Load Balancing Strategy for Grid Computing

Cited by 121 publications

References 9 publications

An Entropic Optimization Technique in Heterogeneous Grid Computing Using Bionic Algorithms

An Entropic Optimization Technique in Heterogeneous Grid Computing Using Bionic Algorithms

A dynamic file replication based on CPU load and consistency mechanism in a trusted distributed environment

A Stringent Authorization using Principles and Policy for Grid Computing

Contact Info

Product

Resources

About