Cost-minimizing scheduling of workflows on a cloud of memory managed multicore machines

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5931 LNCS, Issue , 2009, Pages 435-450

  Grounds, Nicolas G ^a   Antonio, John K ^b   Muehring, Jeff ^a  

^a RiskMetrics Group   (United States)

^b University of Oklahoma   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL TASK; DIRECTED ACYCLIC GRAPHS; MULTI CORE; SCHEDULING FRAMEWORKS; SCHEDULING POLICIES; WORK-FLOWS;

COMPUTER SCIENCE; COST FUNCTIONS; COSTS; GRAPH THEORY; SCHEDULING;

MANAGEMENT;

EID: 71749114492     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-10665-1_40     Document Type: Conference Paper

References (15)

1. Beltrán, M., Guzmán, A., Bosque, J.L.: A new cpu availability prediction model for time-shared systems. IEEE Transactions on Computers 57(7), 865-875 (2008)
2. Zhang, Y., Sun, W., Inoguchi, Y.: Predicting running time of grid tasks on cpu load predictions. Proceedings of the 7th IEEE/ACM International Conference on Grid Computing, 286-292 (September 2006)
3. Appel, A.W.: Garbage collection can be faster than stack allocation. Information Processing Letters 25(4), 275-279 (1987)
4. Hertz, M.: Quantifying and Improving the Performance of Garbage Collection. Ph.D. Dissertation, University of Massachusetts, Amherst (2006)
5. Hertz, M., Berger, E.D.: Quantifying the performance of garbage collection vs. explicit memory management. In: Proceedings of the Object-Oriented Programming Systems, Languages and Applications (OOPSLA 2005) (October 2005)
6. Jones, R., Lins, R.: Garbage Collection: Algorithms for Automatic Dynamic Memory Management. John Wiley & Sons, New York (1996)
7. Koide, H., Oie, Y.: A new task scheduling method for distributed programs that require memory management. Concurrency and Computation: Practice and Experience 18, 941-945 (2006)
8. Dhakal, S., Hayat, M.M., Pezoa, J.E., Yang, C., Bader, D.A.: Dynamic load balancing in distributed systems in the presence of delays: A regeneration-theory approach. IEEE Transactions on Parallel & Distributed Systems 18(4), 485-497 (2007)
9. Dyachuk, D., Deters, R.: Using sla context to ensure quality of service for composite services. IEEE Transactions on Computers 57(7), 865-875 (2008)
10. Kim, J.K., Shivle, S., Siegel, H.J., Maciejewski, A.A., Braun, T., Schneider, M., Tideman, S., Chitta, R., Dilmaghani, R.B., Joshi, R., Kaul, A., Sharma, A., Sripada, S., Vangari, P., Yellampalli, S.S.: Dynamic mapping in a heterogeneous environment with tasks having priorities and multiple deadlines. In: 12th Heterogeneous ComputingWorkshop (HCW2003), Proceedings of the 17th International Parallel and Distributed Processing Symposium (IPDPS 2003) (April 2003)
11. Oh, S.H., Yang, S.M.: A modified least-laxity-first scheduling algorithm for real-time tasks. In: Proceedings of the 5th InternationalWorkshop on Real-Time Computing Systems and Applications (RTCSA 1998), October 1998, pp. 31-36 (1998)
12. Salmani, V., Naghibzadeh, M., Habibi, A., Deldari, H.: Quantitative comparison of job-level dynamic scheduling policies in parallel real-time systems. In: Proceedings TENCON, 2006 IEEE Region 10 Conference (November 2006)
13. Feizabadi, Y., Back, G.: Garbage collection-aware utility accrual scheduling. Real-Time Systems 36(1-2), 3-22 (2007)
14. Shrestha, H.K., Grounds, N., Madden, J., Martin, M., Antonio, J.K., Sachs, J., Zuech, J., Sanchez, C.: Scheduling workflows on a cluster of memory managed multicore machines. In: Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications, PDPTA 2009 (July 2009)
15. Dertouzos, M.L., Mok, A.K.-l.: Multiprocessor on-line scheduling of hard-real-time tasks. IEEE Transactions on Software Engineering 15(12), 1497-1506 (1989)