Resource allocation for distributed streaming applications

Proceedings of the International Conference on Parallel Processing

Volumn , Issue , 2008, Pages 414-421

  Qian, Zhu ^a   Agrawal, Gagan ^a  

^a The Ohio State University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

APPLICATION PERFORMANCES; COMPUTATIONAL REQUIREMENTS; GRID ENVIRONMENTS; LARGE GRAPHS; OPTIMAL ALGORITHMS; PROCESSING STAGES; RESOURCE ALLOCATION ALGORITHMS; RESOURCE ALLOCATION PROBLEMS; RUNNING IN; STREAMING APPLICATIONS; STREAMING DATUMS; SUBGRAPH ISOMORPHISMS;

AGGLOMERATION; APPLICATIONS; COMPUTER RESOURCE MANAGEMENT; PIPELINE PROCESSING SYSTEMS; PIPELINES; PLANNING; RESOURCE ALLOCATION; SET THEORY;

ALGORITHMS;

EID: 55849113042     PISSN: 01903918     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICPP.2008.49     Document Type: Conference Paper

References (31)

1. http://en.wikipedia.org/wiki/Sigmoid_function.
2. http://cs.anu.edu.au/bdm/nauty/.
3. A.Kothari, S.Suri, and Y.H.Zhou. Bandwidth-constrained allocation in grid computing. In Proceedings of the 8th Workshop on Algorithms and Data Structures(WADS03), pages 67-78, July 2003.
4. A.Tang, Z.Lui, C.Xia, and L.Zhang. Distributed resource allocation for stream data processing. In Proceedings of the 2nd International Conference on High Performance Computing and Communications (HPCC 2006), Sept. 2006.
5. B.Agarwalla, N.Ahmed, D.Hilley, and U.Ramachandran. Streamline: A scheduling heuristic for streaming application on the grid. In Proceedings of the 13th Annual Multimedia Computing and Networking Conference (MMCN06), Jan. 2006.
6. B.Babcock, S.Babu, M.Datar, R.Motwani, and D.Thomas. Operator scheduling in data stream systems. The International Journal on Very Large Data Bases, 13, 2004.
7. B.Hong and V.K.Prasanna. Bandwidth-aware resource allocation for heterogeneous computing systems to maximize throughput. In Proceedings of the 32nd International Conference on Parallel Computing (ICPP 2003), pages 539-546, Oct. 2003.
8. B.T.Messmer and H.Bunke. Efficient subgraph isomorphism detection: a decomposition approach. IEEE Transactions on Knowledge and Data Engineering, 12, 2000.
9. Liang Chen and Gagan Agrawal. Supporting Self-Adaptation in Streaming Data Mining Applications. In Proceedings of the International Parallel and Distributed Processing Symposium (IPDPS). IEEE Computer Society Press, April 2006.
10. Liang Chen, Kolagatla Reddy, and Gagan Agrawal. GATES: A GridBased Middleware for Distributed Processing of Data Streams. In Proceedings of IEEE Conference on High Performance Distributed Computing (HPDC). IEEE Computer Society Press, 2004.
11. Y. Chen, L. Qiu, W. Chen, L. Nguyen, and R. Katz. Efficient and adaptive web replication using content clustering. IEEE Journal on Selected Areas in Communications, 6, 2003.
12. D.Carney, U.Cetintemel, M.Cherniack, C.Convey, S.Lee, G.Seidman, M.Stonebraker, N.Tatbul, and S.Zdonik. Monitoring streams - a new class of data management applications. In Proceedings of the 28th International Conference on Very Large Data Bases(VLDB02), pages 215-226, Aug. 2002.
13. D.Eppstein. Subgraph isomorphism in planar graphs and related problems. Journal of Graph Algorithms and Applications, 3, 1999.
14. R.A Drebin, L.Carpenter, and P.Hanrahan. Volume rendering. In Proceedings of the 15th Annual Conference on Computer Graphics and Interactive Techniques, pages 65-74, 1988.
15. E.K.Wong. Model matching in robot vision by subgraph isomorphism. Journal of Pattern Recognition, 25, 1992.
16. M.R. Garey and D.S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman, 1979.
17. H.Abdu, H.Lutfiyya, and M.A.Bauer. Towards efficient resource allocation in distributed systems management. In Proceedings of the 15th International Parallel and Distributed Processing Symposium(IPDPS01), pages 2136-2143, April 2001.
18. H.Bunke and B.T.Messmer. Similarity measures for structured representations. In Proceedings of the 1st European Workshop Topics in Case-Based Reasoning, pages 106-118, 1993.
19. J.Apostolopoulos, T.Wong, W.T.Tan, and S.Wee. On multiple description streaming with content delivery networks. In Proceedings of the 21st Annual Joint Conference of the IEEE Computer and Communications Societies(Infocom02), pages 1736-1745, June 2002.
20. J.Kangasharju, J.Roberts, and K.Ross. Object replication strategies in content distribution networks. Computer Communications, 25, 2002.
21. K.T.Huang and D.Overhauser. A novel graph algorithm for circuit recognition. In Proceedings of the IEEE International Symposium on Circuits and Systems(ISCAS95), pages 1695-1698, April 1995.
22. L.P.Cordella, P.Foggia, C.Sansone, and M.Vento. Performance evaluation of the vf graph matching algorithm. In Proceedings of the 10th International Conference on Image Analysis and Processing (ICIAP99), pages 1172-1177, September 1999.
23. L.P.Cordella, P.Foggia, C.Sansone, and M.Vento. A (sub)graph isomorphism algorithm for matching large graphs. IEEE Transactions on Pattern Analysis and Machine Intelligence, 26, 2004.
24. M.R.Garey and D.S.Johnson. Computers and intractability: A guide to the theory of np-completeness. 1979.
25. P.Willett. Processing of three-dimensional chemical structure information using graph-theoretic techniques. Online Information, 1990.
26. R.Levinson. Pattern associativity and the retrieval of semantic networks. Journal of Computers and Mathematics with Applications, 23, 1992.
27. R.Wolski, N.T.Spring, and Jim Hayes. The network weather service: A distributed resource performance forecasting service for metacomputing. Future Generation Computer Systems, 15, 1999.
28. S.Ali, J.K.Kim, H.J.Siegel, A.A.Maciejewski, Y.Yu, S.B.Gundala, S.Gertphol, and V.Prasanna. Greedy heuristics for resource allocation in dynamic distributed real-time heterogeneous computing systems. In Proceedings of the 2002 International Conference on Parallel and Distributed Processing Techniques and Applications (PDPTA 02), pages 519-530, June 2002.
29. S.Chandrasekaran, O.Cooper, A.Deshpande, M.J.Franklin, J.M.Hellerstein, W.Hong, S.Krishnamurthy, S.Madden, V.Raman, F.Reiss, and M.Shah. Telegraphcq: Continuous dataflow processing for an uncertain world. In Proceedings of the 1st Conference on Innovative Data Systems Research(CIDR03), Jan. 2003.
30. J. R. Ullmann. An algorithm for subgraph isomorphism. Journal of the ACM, 23, 1976.
31. V.Bhat, M.Parashar, and S.Klasky. Experiments with in-transit processing for data intensive grid workflows. In Proceedings of the 8th IEEE/ACM International Conference on Grid Computing(Grid07), Sept. 2007.