Concurrent data processing in a distributed system
作者： Ronnie Chaiken , Bikas Saha , James David Ryseff
DOI:
关键词:
摘要: Systems, methods, and computer media for scheduling vertices in a distributed data processing network allocating computing resources on node are provided. Vertices, subparts of job including both code that runs the data, assigned by manager to cluster process nodes processing. The run transmit resource usage information, memory core usage, back manager. uses this information estimate other either still running or waiting be run. Using estimated each can multiple concurrently.
google.co.uk 参考文章(40)
David A. Rosenblitt, Mahmut Guner, Duojia Lu, Kaaren L. Stuck, Baocheng Bai, Dynamic partitioning of memory into central and peripheral subregions ,(1996)
Martin Rayrole, Method and device or arrangement for the management of a resource schedule ,(2004)
Andrew Francis Ginter, John Bretton Jensen, Thomas W Hutchinson, Daryl Dean Harms, Duration of alerts and scanning of large data stores ,(2006)
Yijung Su, Yang (Jeff) Jiao, System and method for dynamically load balancing multiple shader stages in a shared pool of processing units ,(2006)
Igor Sherb, Joseph Skeffington Wholey, Ephraim Meriwether Vishniac, Managing computing resources in graph-based computations ,(2007)
Ronnie Ira Chaiken, Darren A. Shakib, Achint Srivastava, Simon J. Weaver, William D. Ramsey, Robert John Jenkins, Daniel Dedu-Constantin, Jingren Zhou, Scope: a structured computations optimized for parallel execution script language ,(2009)
Guojing Cong, David A. Bader, Techniques for designing efficient parallel graph algorithms for SMPs and multicore processors international symposium on parallel and distributed processing and applications. pp. 137- 147 ,(2007) , 10.1007/978-3-540-74742-0_15
Moshe Segal, Yuval V. Lirov, Automated resource allocation cutting stock arrangement using random cut patterns ,(1991)