메뉴 건너뛰기




Volumn 37, Issue 10-11, 2011, Pages 694-712

Optimizing latency and throughput of application workflows on clusters

Author keywords

Data parallelism; Latency; Pipelined parallelism; Streaming applications; Task parallelism; Throughput

Indexed keywords

DATA PARALLELISM; LATENCY; PIPELINED-PARALLELISM; STREAMING APPLICATIONS; TASK PARALLELISM;

EID: 80053195132     PISSN: 01678191     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.parco.2010.05.003     Document Type: Conference Paper
Times cited : (12)

References (36)
  • 4
    • 38049180870 scopus 로고    scopus 로고
    • Toward optimizing latency under throughput constraints for application workflows on clusters
    • N. Vydyanathan, Ü.V. atalyürek, T.M. Kur, P. Sadayappan, J.H. Saltz, Toward optimizing latency under throughput constraints for application workflows on clusters, in: 13th Intl. Euro. Conf. on Par. and Dist. Computing, 2007, pp. 173-183.
    • (2007) 13th Intl. Euro. Conf. on Par. and Dist. Computing , pp. 173-183
    • N. Vydyanathan1
  • 5
    • 80053203038 scopus 로고    scopus 로고
    • A duplication based algorithm for scheduling of streaming workflows
    • N. Vydyanathan, Ü.V. atalyürek, T. Kur, P. Sadayappan, J. Saltz, A duplication based algorithm for scheduling of streaming workflows, in: 37th Intl. Conf. on Parallel Processing, 2008.
    • (2008) 37th Intl. Conf. on Parallel Processing
    • N. Vydyanathan1
  • 9
    • 55849149705 scopus 로고
    • Scheduling pipelined communication in distributed memory multiprocessors for real-time applications
    • S.B. Shukla, and D.P. Agrawal Scheduling pipelined communication in distributed memory multiprocessors for real-time applications ACM SIGARCH Computer Architecture News 19 3 1991
    • (1991) ACM SIGARCH Computer Architecture News , vol.19 , Issue.3
    • Shukla, S.B.1    Agrawal, D.P.2
  • 11
    • 80053205040 scopus 로고    scopus 로고
    • A Mapping Methodology for Designing Software Task Pipelines for Embedded Signal Processing
    • Parallel and Distributed Processing
    • M. Lee, W. Liu, V.K. Prasanna, A mapping methodology for designing software task pipelines for embedded signal processing, in: Proceedings of the Workshop on Embedded HPC Systems and Applications of IPPS/SPDP, 1998, pp. 937-944. (Pubitemid 128055466)
    • (1998) Lecture Notes in Computer Science , Issue.1388 , pp. 937-944
    • Lee, M.1    Liu, W.2    Prasanna, V.K.3
  • 13
    • 0033171346 scopus 로고    scopus 로고
    • Precedence-constrained task allocation onto point-to-point networks for pipelined execution
    • S.L. Hary, and F. Ozguner Precedence-constrained task allocation onto point-to-point networks for pipelined execution IEEE Transactions on Parallel and Distributed Systems 10 8 1999 838 851
    • (1999) IEEE Transactions on Parallel and Distributed Systems , vol.10 , Issue.8 , pp. 838-851
    • Hary, S.L.1    Ozguner, F.2
  • 17
    • 34547375171 scopus 로고    scopus 로고
    • Streamline: Scheduling streaming applications in a wide area environment
    • DOI 10.1007/s00530-007-0082-0
    • B. Agarwalla, N. Ahmed, D. Hilley, and U. Ramachandran Streamline: scheduling streaming applications in a wide area environment Multimedia Systems 13 1 2007 69 85 (Pubitemid 47150832)
    • (2007) Multimedia Systems , vol.13 , Issue.1 , pp. 69-85
    • Agarwalla, B.1    Ahmed, N.2    Hilley, D.3    Ramachandran, U.4
  • 19
    • 33646170282 scopus 로고    scopus 로고
    • A static resource allocation framework for grid-based streaming applications: Research articles
    • L. Chen, and G. Agrawal A static resource allocation framework for grid-based streaming applications: research articles Concurrency and Computation - Practice & Experience 18 6 2006 653 666
    • (2006) Concurrency and Computation - Practice & Experience , vol.18 , Issue.6 , pp. 653-666
    • Chen, L.1    Agrawal, G.2
  • 22
    • 53349109681 scopus 로고    scopus 로고
    • Complexity results for throughput and latency optimization of replicated and data-parallel workflows
    • A. Benoit, Y. Robert, Complexity results for throughput and latency optimization of replicated and data-parallel workflows, in: Proceedings of the 2007 IEEE International Conference on Cluster Computing, 2007, pp. 497-506.
    • (2007) Of the 2007 IEEE International Conference on Cluster Computing , pp. 497-506
    • Benoit, A.1    Robert, Y.2
  • 26
    • 38049173727 scopus 로고    scopus 로고
    • An Approach for Optimizing Latency under Throughput Constraints for Application Workflows on Clusters
    • The Ohio State University
    • N. Vydyanathan, U. Catalyurek, T. Kurc, P. Sadayappan, J. Saltz, An Approach for Optimizing Latency under Throughput Constraints for Application Workflows on Clusters, Tech. Rep. OSU-CISRC-1/07-TR03, The Ohio State University, 2007.
    • (2007) Tech. Rep. OSU-CISRC-1/07-TR03
    • Vydyanathan, N.1    Catalyurek, U.2    Kurc, T.3    Sadayappan, P.4    Saltz, J.5
  • 27
    • 0002050141 scopus 로고    scopus 로고
    • Static scheduling algorithms for allocating directed task graphs to multiprocessors
    • Y.-K. Kwok, and I. Ahmad Static scheduling algorithms for allocating directed task graphs to multiprocessors ACM Computing Surveys 31 4 1999 406 471
    • (1999) ACM Computing Surveys , vol.31 , Issue.4 , pp. 406-471
    • Kwok, Y.-K.1    Ahmad, I.2
  • 28
    • 0023866688 scopus 로고
    • Grain size determination for parallel processing
    • DOI 10.1109/52.1991
    • B. Kruatrachue, and T. Lewis Grain size determination for parallel processing IEEE Software 5 1 1988 23 32 (Pubitemid 18596651)
    • (1988) IEEE Software , vol.5 , Issue.1 , pp. 23-32
    • Kruatrachue, B.1    Lewis, T.2
  • 29
    • 0025418536 scopus 로고
    • Towards an architecture-independent analysis of parallel algorithms
    • C. Papadimitriou, and M. Yannakakis Towards an architecture independent analysis of parallel algorithms SIAM Journal of Computing 19 1990 322 328 (Pubitemid 20670116)
    • (1990) SIAM Journal on Computing , vol.19 , Issue.2 , pp. 322-328
    • Papadimitriou Christos, H.1    Yannakakis Mihalis2
  • 30
    • 0001769792 scopus 로고
    • C.P.M. scheduling with small computation delays and task duplication
    • J. Colin, and P. Chretienne C.P.M. scheduling with small computation delays and task duplication Operations Research 1991 680 684
    • (1991) Operations Research , pp. 680-684
    • Colin, J.1    Chretienne, P.2
  • 31
    • 85014168050 scopus 로고
    • Application and performance analysis of a compile-time optimization approach for list scheduling algorithms on distributed-memory multiprocessors
    • Y. Chung, and S. Ranka Application and performance analysis of a compile-time optimization approach for list scheduling algorithms on distributed-memory multiprocessors Proceedings of Supercomputing 1992 512 521
    • (1992) Proceedings of Supercomputing , pp. 512-521
    • Chung, Y.1    Ranka, S.2
  • 32
    • 0029359621 scopus 로고
    • Comparative study of task duplication static scheduling versus clustering and non-clustering techniques
    • B. Shirazi, H. Chen, and J. Marquis Comparative study of task duplication static scheduling versus clustering and non-clustering techniques Concurrency: Practice and Experience 7 5 1995 371 390
    • (1995) Concurrency: Practice and Experience , vol.7 , Issue.5 , pp. 371-390
    • Shirazi, B.1    Chen, H.2    Marquis, J.3
  • 33


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.