Skip to main content
SpringerLink
Log in

Dual Heap Overlay for Range Queries for Handling Hardware Resources

  • Research Article - Computer Engineering and Computer Science
  • Published:
Arabian Journal for Science and Engineering Aims and scope Submit manuscript

Abstract

Grid resource discovery involves resolving various types of queries including exact match and range queries. Our recent effort resulted in Dual Heap Overlay Resource Discovery Protocol for a Mobile Grid (DEEPG) to resolve exact match queries. DEEPG attempted to reduce the search set for query resolution by rejecting nodes which do not satisfy the sum of the attributes specified in the query. In this paper, we propose DEEPG-R, a Dual Heap Overlay Resource Discovery Protocol for Range Queries in Grid. Distributed Hash Table (DHT) based resource discovery mechanism is common in the field and fails to handle few challenges. Hence, DEEPG-R employs the non-DHT based overlays of DEEPG and is tuned to handle range queries. The focus of the extended protocol is on reducing the number of comparisons further by comparing the resource attributes with the lower and upper bounds specified in the range query. Simulation results prove that the proposed protocol is efficient with reduced search time complexities and low maintenance overheads.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Hotovy, S.: Workload evolution on the Cornell theory center IBM SP2. Job Scheduling Strategies for Parallel Proc. Workshop (IPPS 96), pp. 27–40 (1996)

  2. Mohamadi Begum Y., Maluk Mohamed M.A.: DEEPG: dual heap overlay resource discovery protocol for mobile grid. Scalability Comput. Pract. Exp. 12(2), 239–255 (2011)

    Google Scholar 

  3. Ian, G.; David, W.: Architectural considerations for cryptanalytic hardware. In: Cracking DES: Secrets of Encryption Research, Wiretap Politics & Chip Design, O’Reilly, pp. 10-1–10-26 (1998)

  4. Brute-force attack. http://en.wikipedia.org/wiki/Brute-force_attack (Accessed 22 May 2012)

  5. Goldberg, D.E.: Genetic Algorithms in Search, Optimization, and Machine Learning. Addison-Wesly, USA (1989)

  6. Dimovski, A.; Gligoroski, D.: Attacks on the transposition ciphers using optimization heuristics. International Scientific Conference on Information, Communication and Energy Systems and Technologies ICEST 2003 (2003)

  7. Toemeh, R.; Arumugam, S.: Applying genetic algorithms for searching key space of polyalphabetic substitution ciphers. Int. Arab J. Inf. Technol. 5(1) (2008)

  8. Ranjan R., Harwood A., Buyya R.: Peer-to-peer-based resource discovery in global grids: a tutorial. IEEE Commun. Surv. Tutor. 10(2), 6–33 (2008)

    Article  Google Scholar 

  9. Anand, P.; Sukumar, G.; Shaowen, W.: A self-organized grouping (SOG) framework for efficient grid resource discovery. J. Grid Comput. 8(3), 365–389 (2010)

    Google Scholar 

  10. Hong, S.G.; Volker, H.; Henning, S.: Evaluation of control message overhead of a DHT-based P2P system. Bell Labs Tech. J. 13(3), 79–86 (2008)

    Google Scholar 

  11. Talia, D.; Trunfio, P.; Zeng, J.: Peer-to-peer models for resource discovery in large-scale grids: a scalable architecture. In: Proceedings of 7th International Conference on High Performance Computing in Computational Sciences (Vecpar 2006), Rio de Janeiro, LNCS, vol. 4395. Springer, New York, pp. 66–78 (2006)

  12. Andrzejak, A.; Xu, Z.: Scalable, efficient range queries for grid information services. In: Proceedings of the Second International Conference on Peer to Peer Computing (P2P 02). IEEE Computer Society, Washington, p. 33 (2002)

  13. Spence D.; Harris,T.: XenoSearch: distributed resource discovery in the XenoServer open platform. In: Proceedings of Twelfth IEEE International Symposium on High Performance Distributed Computing (HPDC 03), pp. 216–225 (2003)

  14. Ratnasamy, S.; Hellerstein, J.M.; Shenker, S.: Range queries over DHTs. IRB-TR-03-009, Intel Corporation (2003)

  15. Cai, M.; Frank, M.; Chen, J.; Szekely, P.: MAAN: a multi-attribute addressable network for grid information services. J. Grid Comput. (2004)

  16. Hentschel, M.; Li, M.; Ponraj, M.; Qi, M.: Distributed indexing for resource discovery in P2P networks. In: Proceedings of 9th IEEE/ACM International Symposium on Cluster Computing and the Grid (CCGrid 09), pp. 550–555 (2009)

  17. Harvey, N.J.A.; Jones, M.B.; Saroiu, S.; Theimer, M.; Wolman, A.: SkipNet: a scalable overlay network with practical locality properties. In: Proceedings of Fourth USENIX Symposium on Internet Technologies and Systems (USITS 03), pp. 113–126 (2003)

  18. González-Beltrá N., Milligan P., Sage P.: Range queries over skip tree graphs. Comput. Commun. 31, 358–374 (2008)

    Article  Google Scholar 

  19. Agarwal, B.M.; Seshan, S.: MERCURY: supporting scalable multi-attribute range queries. Proc. SIGCOMM 2004 (2004)

  20. Sun, H.; Huai, J.; Liu, Y.; Buyya, R.: RCT: a distributed tree for supporting efficient range and multi-attribute queries in grid computing. Future Gener. Comput. Syst. 24, 631–643 (2008)

    Google Scholar 

  21. Chen, S.; Shi, B.; Chen, S.; Xia, Y.: ACOM: any-source capacity-constrained overlay multicast in non-DHT P2P networks. IEEE Trans. Parallel Distrib. Syst. 18(9) (2007)

  22. Jagadish, H.V.; Ooi, B.C.; Vu, Q.H.: BATON: a balanced tree structure for peer-to-peer networks. In: Proceedings of the 31st International Conference on Very Large Data Bases (VLDB), pp. 661–672 (2005)

  23. Jagadish, H.V.; Ooi B.C.; Tan, K.L.; Vu, Q.H.; Zhang, R.: Speeding up search in peer-to-peer networks with a multi-way tree structure. In: Proc. SIGMOD2006, pp. 1–12 (2006)

  24. Sun, M.T.; King, C.-T.; Sun, W.-H.; Chang, C.-P.: Attribute-based overlay network for non-DHT structured peer-to-peer lookup. In: Proceedings of International Conference on Parallel Processing (ICPP 07) (2007)

  25. Sun, X.; Chen, X.: SRing: a structured non DHT P2P overlay supporting string range queries. In: Proc. WWW 2007 (2007)

  26. Shen, H.; Apon, A.; Xu, C.: LORM: supporting low-overhead P2P-based range-query and multi-attribute resource management in grids. In: Proc. of ICPADS 07 (2007)

  27. Albrecht, J.; Oppenheimer, D.; Vahdat, A.; Patterson, D.A.: Design and implementation tradeoffs for wide-area resource discovery. ACM Trans. Internet Technol. 8(4) (2008)

  28. Azzedin, F.; Maheswaran, M.: Towards trust-aware resource management in grid computing systems. In: Proceedings of the 2nd IEEE/ACM International Symposium on Cluster Computing and the Grid (CCGRID 02) (2002)

  29. Liu, C.; Foster, I.: A constraint language approach to matchmaking. In: Proc. RIDE 04 (2004)

  30. Knuth, D.E.: The Art of Computer Programming. Addison-Wesley, USA (1973)

  31. Atkinson, M.D.; Sack, J.-R.; Santoro, N.; Strothotte, T.: Min–max heaps and generalized priority queues. Commun. ACM 29(10) (1986)

  32. Xhafa F., Abraham A.: Computational models and heuristic methods for grid scheduling problems. Future Gener. Comput. Syst. 26, 608–621 (2010)

    Article  Google Scholar 

  33. Buyya, R.; Murshed, M.: GridSim: a toolkit for the modeling and simulation of distributed resource management and scheduling for grid computing. Concurr. Comput. Pract. Exp. 14, 1175–1220 (2002)

  34. Shen, H.; Ze, L.: SPPS: a scalable P2P-based proximity-aware multi-resource discovery scheme for grids. IEEE Military Communications Conference (MILCOM 2008), pp. 1–7 (2008)

  35. Teo, Y.M.; March, V.; Wang, X.: A DHT-based grid resource indexing and discovery scheme. In: Proceedings of the MIT Alliance Annual Symposium, Singapore (2005)

  36. Schmidt, C.; Parashar, M.: Flexible information discovery in decentralized distributed systems. In: Proceedings of the Twelfth International Symposium on High Performance Distributed Computing (HPDC 03). IEEE, Washington (2003)

  37. Crainiceanu, A.; Linga, P.; Gehrke, J.; Shanmugasundaram, J.: Querying peer-to-peer networks using p-trees. In: Proceedings of the 7th International Workshop on the Web and Databases (WebDB 04). ACM Press, New York, pp. 25–30 (2004)

  38. Ramabhadran, S.; Ratnasamy, S.; Hellerstein, J.M.; Shenker, S.: Brief announcement: prefix hash tree. In: Proceedings of ACM PODC. ACM Press, Newyork (2004)

Download references

Author information

Authors and Affiliations

  1. Software Systems Group, M.A.M. College of Engineering, Tiruchirappalli, India

    Y. Mohamadi Begum & M. A. Maluk Mohamed

Authors
  1. Y. Mohamadi Begum
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. M. A. Maluk Mohamed
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Y. Mohamadi Begum.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Mohamadi Begum, Y., Maluk Mohamed, M.A. Dual Heap Overlay for Range Queries for Handling Hardware Resources. Arab J Sci Eng 39, 1737–1747 (2014). https://doi.org/10.1007/s13369-013-0724-9

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s13369-013-0724-9

Keywords

Search

Navigation