default search action
JSSPP 2010: Atlanta, GA, USA
- Eitan Frachtenberg, Uwe Schwiegelshohn:
Job Scheduling Strategies for Parallel Processing - 15th International Workshop, JSSPP 2010, Atlanta, GA, USA, April 23, 2010, Revised Selected Papers. Lecture Notes in Computer Science 6253, Springer 2010, ISBN 978-3-642-16504-7 - Kaiqi Xiong, Sang C. Suh:
Resource Provisioning in SLA-Based Cluster Computing. 1-15 - Atsuko Takefusa, Hidemoto Nakada, Tomohiro Kudoh, Yoshio Tanaka:
An Advance Reservation-Based Co-allocation Algorithm for Distributed Computers and Network Bandwidth on QoS-Guaranteed Grids. 16-34 - Ding Ding, Siwei Luo, Zhan Gao:
A Greedy Double Auction Mechanism for Grid Resource Allocation. 35-50 - Georg Birkenheuer, André Brinkmann, Holger Karl:
Risk Aware Overbooking for Commercial Grids. 51-76 - Alexander Fölling, Christian Grimme, Joachim Lepping, Alexander Papaspyrou:
The Gain of Resource Delegation in Distributed Computing Environments. 77-92 - Erik Saule, Doruk Bozdag, Ümit V. Çatalyürek:
A Moldable Online Scheduling Algorithm and Its Application to Parallel Short Sequence Mapping. 93-109 - Thomas Sandholm, Kevin Lai:
Dynamic Proportional Share Scheduling in Hadoop. 110-131 - Dalibor Klusácek, Hana Rudová:
The Importance of Complete Data Sets for Job Scheduling Simulations. 132-153 - Yinglong Xia, Viktor K. Prasanna, James Li:
Hierarchical Scheduling of DAG Structured Computations on Manycore Processors with Dynamic Thread Grouping. 154-174 - Sam Verboven, Kurt Vanmechelen, Jan Broeckhove:
Multiplexing Low and High QoS Workloads in Virtual Environments. 175-190 - Satoshi Yamada, Shigeru Kusakabe:
Proposal and Evaluation of APIs for Utilizing Inter-Core Time Aggregation Scheduler. 191-207 - Dan Tsafrir:
Using Inaccurate Estimates Accurately. 208-221
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.