Distributed Scheduler of Workflows with Deadlines in a P2P Desktop Grid

Celaya, Javier; Arronategui, Unai

doi:10.1109/pdp.2010.41

Cited by 8 publications

(6 citation statements)

References 8 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In their method, the nodes simultaneously register the jobs, help routing and execute the jobs. After registering a job, the corresponding node is in charge of supervising the job and monitoring the progress (Celaya and Arronategui, 2010). Although the resource management is distributed, jobs are not performed without the supervision of the corresponding node, and it is far away from ideal distributed management because it leads to partial centralized replication management.…”

Section: Related Workmentioning

confidence: 99%

Community-based replica management in distributed systems

Nosrati

Fazlali

2018

IJWIS

View full text Add to dashboard Cite

Purpose One of the techniques for improving the performance of distributed systems is data replication, wherein new replicas are created to provide more accessibility, fault tolerance and lower access cost of the data. In this paper, the authors propose a community-based solution for the management of data replication, based on the graph model of communication latency between computing and storage nodes. Communities are the clusters of nodes that the communication latency between the nodes are minimum values. The purpose of this study if to, by using this method, minimize the latency and access cost of the data. Design/methodology/approach This paper used the Louvain algorithm for finding the best communities. In the proposed algorithm, by requesting a file according to the nodes of each community, the cost of accessing the file located out of the applicant’s community was calculated and the results were accumulated. On exceeding the accumulated costs from a specified threshold, a new replica of the file was created in the applicant’s community. Besides, the number of replicas of each file should be limited to prevent the system from creating useless and redundant data. Findings To evaluate the method, four metrics were introduced and measured, including communication latency, response time, data access cost and data redundancy. The results indicated acceptable improvement in all of them. Originality/value So far, this is the first research that aims at managing the replicas via community detection algorithms. It opens many opportunities for further studies in this area.

show abstract

Section: Related Workmentioning

confidence: 99%

Community-based replica management in distributed systems

Nosrati

Fazlali

2018

IJWIS

View full text Add to dashboard Cite

show abstract

“…However, for peer selection, peer credibility is also required to be considered. Javier Celaya and Unai Arronategui in [13] proposed a new scalable scheduler for workflows with deadlines in a P2P desktop grid. The scheduler is built upon a tree-based network overlay with a distributed management of availability time intervals of resources.…”

Section: Related Workmentioning

confidence: 99%

“…The peer credibility C P in [13] given as the probability that the result produced by a peer is correct.…”

Section: Peer Credibilitymentioning

confidence: 99%

See 1 more Smart Citation

Identification of Efficient Peers in P2P Computing System for Real Time Applications

Dubey¹

2012

IJP2P

View full text Add to dashboard Cite

Currently the Peer-to-Peer computing paradigm rises as an economic solution for the large scale computation problems. However due to the dynamic nature of peers it is very difficult to use this type of systems for the computations of real time applications. Strict deadline of scientific and real time applications require predictable performance in such applications. We propose an algorithm to identify the group of reliable peers, from the available peers on the Internet, for the processing of real time application's tasks. The algorithm is based on joint evaluation of peer properties like peer availability, credibility, computation time and the turnaround time of the peer with respect to the task distributor peer. Here we also define a method to calculate turnaround time (distance) on task distributor peers at application level.

show abstract

“…The peers in the system can freely join and leave the system, in between the computation, without any constraints. Such situations are known as peer autonomy failure [13]. It leads to the delay and suspension of computations which are not acceptable for real time application tasks.…”

Section: Identification Of Group Of Reliable Peersmentioning

confidence: 99%

Untitled

2012

IJP2P

View full text Add to dashboard Cite

Currently the Peer-to-Peer computing paradigm rises as an economic solution for the large scale computation problems. However due to the dynamic nature of peers it is very difficult to use this type of systems for the computations of real time applications. Strict deadline of scientific and real time applications require predictable performance in such applications. We propose an algorithm to identify the group of reliable peers, from the available peers on the Internet, for the processing of real time application's tasks. The algorithm is based on joint evaluation of peer properties like peer availability, credibility, computation time and the turnaround time of the peer with respect to the task distributor peer.Here we also define a method to calculate turnaround time (distance) on task distributor peers at application level.

show abstract

Distributed Scheduler of Workflows with Deadlines in a P2P Desktop Grid

Cited by 8 publications

References 8 publications

Community-based replica management in distributed systems

Community-based replica management in distributed systems

Identification of Efficient Peers in P2P Computing System for Real Time Applications

Untitled

Contact Info

Product

Resources

About