Resource Choice in Large Level Scattered Systems By Means Of Accessibility of Information

Bachina Anusha; T.V.Sai Krishna

doi:https://doi.org/10.14445/22492593/IJCOT-V1I3P309

Research Article | Open Access | Download PDF

Volume 1 | Issue 3 | Year 2011 | Article Id. IJCOT-V1I3P309 | DOI : https://doi.org/10.14445/22492593/IJCOT-V1I3P309

Resource Choice in Large Level Scattered Systems By Means Of Accessibility of Information

Bachina Anusha , T.V.Sai Krishna

Citation :

Bachina Anusha , T.V.Sai Krishna, "Resource Choice in Large Level Scattered Systems By Means Of Accessibility of Information," International Journal of Computer & Organization Trends (IJCOT), vol. 1, no. 3, pp. 45-49, 2011. Crossref, https://doi.org/10.14445/22492593/ IJCOT-V1I3P309

Abstract

Scientific applications are data intensive and require access to a significant amount of dispersed data. Hence, in order to accommodate data - intensive applications in loosely coupled distributed systems, it is essential to consider not only the computational capability, but also the data accessibility of computational nodes to the required data objects. We introduce the notion of accessibility to capture both availability and performance. An increasing number of data - intensive applications require not only considerations of node computation power but also accessibility for adequate job allocations. For instance, selecting a node with intolerably slow connections can offset any benefit to running on a fast node. In this project, we present accessibility - aware resource selection tec hniques by which it is possible to choose nodes that will have efficient data access to remote data sources. We show that the local data access observations collected from a node’s neighbors are sufficient to characterize accessibility for that node. The s uggested techniques are also shown to be stable even under churn despite the loss of prior observations.

Keywords

Data Accessibility, resource choice, large - level scattered systems

References

[1] D.P. Anderson and G. Fedak, “The Computational and Storage
[2] A. Haeberlen, A. Mislove, and P. Druschel, “Glacier: Highly Durable, Decentralized Storage Despite Massive Correlated Failures,”Proc. Symp. Networked Systems Design and Implementation(NSDI ’05), May 2005.
[3] J. Kubiatowicz, D. Bindel, Y. Chen, P. Eaton, D. Geels, R. Gummadi,S. Rhea, H. Weatherspoon, W. Weimer, C. Wells, and B. Zhao,“Oceanstore: An Architecture for Global-Scale Persistent Storage,”Proc. ACM Int’l Conf. Architectural Support for ProgrammingLanguages and Operating Systems (ASPLOS ’07), Nov. 2000.KIM ET AL.: USING DATA ACCESSIBILITY FOR RESOURCE SELECTION IN LARGE-SCALE DISTRIBUTED SYSTEMS 799
[5] A. Chien, B. Calder, S. Elbert, and K. Bhatia, “Entropia: Architecture and Performance of an Enterprise Desktop Grid System,” J. Parallel and Distributed Computing, 49] D.P. Anderson, J. Cobb, E. Korpela, M. Lebofsky, and D. Werthimer, “Seti@home: An Experiment in Public-Resource Computing,” Comm. ACM, vol. 45, no. 11, pp. 56-61, 2002.
[6] “Search for Extraterrestrial Intelligence (SETI) Project,”
[7] “BOINC: Berkeley Open Infrastructure for Network Computing,”
[8] N. Massey, T. Aina, M. Allen, C. Christensen, D. Frame, D. Goodman, J. Kettleborough, A. Martin, S. Pascoe, and D. Stainforth,“Data Access and Analysis with Distributed Federated DataServers in climateprediction.net,” Advances in Geosciences, vol. 8,pp. 49-56, June 2006.
[9] G.B. Berriman, A.C. Laity, J.C. Good, J.C. Jacob, D.S. Katz, E.Deelman, G. Singh, M.-H. Su, and T.A. Prince, “Montage: The Architecture and Scientific Applications of a National Virtual Observatory Service for Computing Astronomical Image Mosaics,”
[10] “BLAST: The Basic Local Alignment Search Tool,” http:// www.ncbi.nlm.nih.gov/blast, 2009.
[11] W. Hoschek, F.J. Jae´n-Martı´nez, A. Samar, H. Stockinger, and K. Stockinger, “Data Management in an International Data Grid Project,” Proc. IEEE/ACM Int’l Conf. Grid Computing (GRID ’00), pp. 77-90, 2000.
[12] Y.-M. Teo, X. Wang, and Y.-K. Ng, “Glad: A System for Developing and Deploying Large-Scale Bioinformatics Grid,” Bioinformatics, vol. 21, no. 6, pp. 794-802, 2005.
[13] S. Hotz, “Routing Information Organization to Support Scalable Interdomain Routing with Heterogeneous Path Requirements,”PhD dissertation, 1994.
[14] J.D. Guyton and M.F. Schwartz, “Locating Nearby Copies of Replicated Internet Servers,” SIGCOMM Computer Comm. Rev., vol. 25, no. 4, pp. 288-298, 1995.
[15] E. Ng and H. Zhang, “Predicting Internet Network Distance with Coordiantes-Based Approaches,” Proc. IEEE INFOCOM
[16] E. Cohen and S. Shenker, “Replication Strategies in Unstructured Peer-to-Peer Networks,” Proc. ACM SIGCOMM
[17] Q. Lv, P. Cao, E. Cohen, K. Li, and S. Shenker, “Search and Replication in Unstructured Peer-to-Peer Networks,” Proc. ACM SIGMETRICS ’02, pp. 258-259, 2002.
[18] S. Ratnasamy, P. Francis, M. Handley, R. Karp, and S. Schenker,“A Scalable Content-Addressable Network,” Proc. ACM SIGCOMM
[19] A. Rowstron and P. Druschel, “Pastry: Scalable, Distributed Object Location and Routing for Large-Scale Peer-to-Peer Systems,”
[20] “PlanetLab Iperf,” http://jabber.services.planetlab.org/php/