摘要(英) |
The data of star observation is huge and increase continuously. Therefore it needs strong hardware to store these data. If these data lacks of a efficiently manage methodology, users will need to find and get data themselves, it’s not a good and efficient way. In order to solve this problem, this paper proposes a hierarchical design distributed file system to manage these astronomical observation data. First, this system uses Hierarchical Triangular Mesh to compute a key for every star, the values of these keys are sequential, so this paper links the servers in the system to form a ring structure, and let every server manages an unrepeated range of keys, range that every two adjacent servers manage are also continuous. Besides, The reason why adopting ring structure is due to its scalability, fault tolerance and availability, these advantages build the good foundation of the system.
For increase the efficiency of query, the system needs execute multiple services. To reduce the load of servers, this paper builds three level of the ring structure and allocates these services to different layer. These layers are 1. Query Transaction, 2. Data index, 3. Storage. This design not only reduces the load, but also makes these services independent.
|
參考文獻 |
[1] Napster, http://www.napster.com
[2] Patrick Kirk (2003). Gnutella File Sharing And Distribution Network, Retrieved June 28, 2007, The Gnutella Homepage: http://rfc-Gnutella.sourceforge.net/
[3] Ratnasamy, S., Francis, P., Handley, M., Karp, R., and Shenker, S., “ A scalable content-addressable network”, In Proc. ACM SIGCOMM (San Diego, CA, August 2001), pp. 161–172.
[4] I. Stoica, R. Morris et al., “Chord: A Scalable Peer-to-Peer Lookup Protocol for Internet Applications,” IEEE/ACM Trans. Net., vol. 11, no. 1, 2003, pp. 17–32.
[5] Zhao Cao.,Kan Li.,Yushu Liu., “A Multi-Level Super Peer Based P2P Architecture”, Information Networking,2008. ICON 2008.
[6] K. Aberer, P. Cudr´e-Mauroux, A. Datta, Z. Despotovic, M. Hauswirth, M. Punceva, and R. Schmidt. P-grid: A self-organizing structured p2p system. ACM SIGMOD Record, 32(3), 2003.
[7] Fabrizio Marozzo., Domenico Talia., Paolo Trunfio., “P2P-MapReduce:Parallel data processing in dynamic Cloud environments”, Journal of Computer and System Science 78(2012) 1382-1402.
[8] L. Gong, JXTA: A network programming environment, IEEE Internet Comput. 5 (3) (2001) 88–95.
[9] Kunszt, P. Z., Szalay, A. S., Csabai, I., Thakar, A. R., “The Indexing of the SDSS Science Archive,” Proceeding of ADASS IX, 2000, 216, 141–144.
[10] Kunszt, P. Z., Szalay, A. S., and Thakar, A. R., “The Hierarchical Triangular Mesh, in Mining the Sky, ” ed. A. J. Banday, S. Zaroubi, and M. Bartelmann (Berlin: Springer-Verlag), 2001, 631–637.
[11] W. O’Mullane, A.J. Banday, K.M. Gorski, P. Kuntz, A.S. Szalay, “Splitting the Sky – HTM and HEALPix,” Mining the Sky, Banday et al ed, Springer, 2000, p 639–648
[12] SkyServer – HTM, http://www.skyserver.org/HTM/
[13] 鄭凱豪., “Distributed Large-Scale Astronomical Data Management System Based on HTM Index”., ”National Central University”
[14] Alexander S. Szalay, Jim Gary, George Fekete. Peter Z. Kunszt, Peter Kukol, Ani Thakar, “Indexing the Sphere with the Hierarchical Triangular Mesh”, Technical Report MSR-TR-2005-123
[15] Peter Z. Kunszt, Alexander S. Szalay, Aniruddha R. Thakar., “Hierarchical Triangular Meah”., Baltimore MD,21218, USA
[16] Mark R. Calabretta., Boudewijn F. Roukema., “Mapping on HealPix grid”., MNRAS 2007 July 25
|