Zobrazeno 1 - 10
of 118
pro vyhledávání: '"Uwe Schwiegelshohn"'
Publikováno v:
Job Scheduling Strategies for Parallel Processing ISBN: 9783031226977
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::3ab99d0c438fdbafb2868cbbccc5fd71
https://doi.org/10.1007/978-3-031-22698-4_2
https://doi.org/10.1007/978-3-031-22698-4_2
Autor:
Uwe Schwiegelshohn
Publikováno v:
2022 IEEE International Parallel and Distributed Processing Symposium Workshops (IPDPSW).
Publikováno v:
SPAA
We consider a basic admission control problem in which jobs with deadlines arrive online and our goal is to maximize the total volume of executed job processing times. We assume that the deadlines have a slack of at least e, that is, each deadline d
Publikováno v:
ICCS
In this paper, we investigate the differences and similarities in user job submission behavior in High Performance Computing (HPC) and High Throughput Computing (HTC). We consider job submission behavior in terms of parallel batch-wise submissions, a
Autor:
Johnatan E. Pecero, Andrei Tchernykh, Pascal Bouvry, Alexander Yu. Drozdov, Sergio Nesmachnow, Luz Lozano, Uwe Schwiegelshohn
Publikováno v:
Journal of Grid Computing. 14:5-22
This paper focuses on a bi-objective experimental evaluation of online scheduling in the Infrastructure as a Service model of Cloud computing regarding income and power consumption objectives. In this model, customers have the choice between differen
Autor:
Stephan Schlagkamp, Ewa Deelman, Rafael Ferreira da Silva, Uwe Schwiegelshohn, William Allcock
Publikováno v:
HPDC
Understanding user behavior is crucial for the evaluation of scheduling and allocation performances in HPC environments. This paper aims to further understand the dynamic user reaction to different levels of system performance by performing a compreh
Adaptive parallel job scheduling with resource admissible allocation on two-level hierarchical grids
Autor:
Ramin Yahyapour, Adán Hirales-Carbajal, Juan Manuel Ramírez-Alcaraz, Uwe Schwiegelshohn, Ariel Quezada-Pina, Andrei Tchernykh, Vanessa Miranda-Lopez, José Luis González-García
Publikováno v:
Future Generation Computer Systems. 28:965-976
We evaluate job scheduling algorithms that integrate both tasks of Grid scheduling: job allocation to Grid sites and local scheduling at the sites. We propose and analyze an adaptive job allocation scheme named admissible allocation. The main idea of
Autor:
Kamol Limtanyakul, Uwe Schwiegelshohn
Publikováno v:
Constraints. 17:172-203
In the automotive industry, a manufacturer must perform several hundreds of tests on prototypes of a vehicle before starting its mass production. Tests must be allocated to suitable prototypes and ordered to satisfy temporal constraints and various k
Autor:
Uwe Schwiegelshohn
Publikováno v:
Operations Research Letters. 39:255-259
In a well-known paper from 1986, Kawaguchi and Kyan proved that the Largest-Ratio-First rule for total weighted completion time scheduling on identical parallel machines has a worst case ratio of 12(1+2). We provide an alternative and simple proof fo
Autor:
Uwe Schwiegelshohn
Publikováno v:
Journal of Scheduling. 14:571-581
The paper discusses a rarely used metric that is well suited to evaluate online schedules for independent jobs on massively parallel processors. The metric is based on the total weighted completion time objective with the weight being the resource co