Amortized efficiency of list update and paging rules
Communications of the ACM
Scheduling Multiprocessor Tasks to Minimize Schedule Length
IEEE Transactions on Computers
Complexity of scheduling parallel task systems
SIAM Journal on Discrete Mathematics
Introduction to parallel algorithms and architectures: array, trees, hypercubes
Introduction to parallel algorithms and architectures: array, trees, hypercubes
A heuristic of scheduling parallel tasks and its analysis
SIAM Journal on Computing
Highly parallel computing (2nd ed.)
Highly parallel computing (2nd ed.)
Dynamic scheduling on parallel machines
Theoretical Computer Science - Special issue on dynamic and on-line algorithms
Scheduling Parallel Machines On-line
SIAM Journal on Computing
Resource scheduling for parallel database and scientific applications
Proceedings of the eighth annual ACM symposium on Parallel algorithms and architectures
Approximation algorithms for bin packing: a survey
Approximation algorithms for NP-hard problems
Scheduling computer and manufacturing processes
Scheduling computer and manufacturing processes
Online computation and competitive analysis
Online computation and competitive analysis
Developments from a June 1996 seminar on Online algorithms: the state of the art
Developments from a June 1996 seminar on Online algorithms: the state of the art
Parallel Query Scheduling and Optimization with Time- and Space-Shared Resources
VLDB '97 Proceedings of the 23rd International Conference on Very Large Data Bases
Parallel Job Scheduling: Issues and Approaches
IPPS '95 Proceedings of the Workshop on Job Scheduling Strategies for Parallel Processing
Towards Convergence in Job Schedulers for Parallel Supercomputers
IPPS '96 Proceedings of the Workshop on Job Scheduling Strategies for Parallel Processing
Theory and Practice in Parallel Job Scheduling
IPPS '97 Proceedings of the Job Scheduling Strategies for Parallel Processing
Dynamic Load Balancing in Parallel Database Systems
Euro-Par '96 Proceedings of the Second International Euro-Par Conference on Parallel Processing - Volume I
Lower Bounds for On-line Scheduling with Precedence Constraints on Identical Machines
APPROX '98 Proceedings of the International Workshop on Approximation Algorithms for Combinatorial Optimization
Polynomial time approximation schemes for general multiprocessor job shop scheduling
Journal of Algorithms
Incomplete solution approach for the maximum clique finding in the real time systems
AIA'06 Proceedings of the 24th IASTED international conference on Artificial intelligence and applications
On-line scheduling mesh jobs with dependencies
Theoretical Computer Science
On places suitable for applying AI principles in NP-hard graph problems' algorithms
AIAP'07 Proceedings of the 25th conference on Proceedings of the 25th IASTED International Multi-Conference: artificial intelligence and applications
On-line scheduling of parallel jobs in a list
Journal of Scheduling
An approach for the maximum clique finding problem test tool software engineering
SE'07 Proceedings of the 25th conference on IASTED International Multi-Conference: Software Engineering
On-line scheduling of parallel jobs on two machines
Journal of Discrete Algorithms
Artificial intelligence in the maximum clique finding problem applications
ICAI'06 Proceedings of the 7th WSEAS International Conference on Automation & Information
Applying AI and incomplete solution principles to solve NP-hard problems in the real-time systems
ICCOMP'06 Proceedings of the 10th WSEAS international conference on Computers
Approximation Algorithms for Scheduling Parallel Jobs
SIAM Journal on Computing
On-line scheduling of multi-core processor tasks with virtualization
Operations Research Letters
| Hi-index | 5.23 |
Consider the execution of a parallel application that dynamically generates parallel jobs with specified resource requirements during its execution. We assume that there is not suffucient knowledge about the running times and the number of jobs generated in order to precompute a schedule for such applications. Rather, the scheduling decisions have to be made on-line during runtime based on incomplete information. We present several on-line scheduling algorithms for various interconnection topologies that use some a priori information about the job running times or guarantee a good competitive ratio that depends on the runtime ratio of all generated jobs. All algorithms presented have optimal competitive ratio up to small additive constants, and are easy to implement. Copyright 2001 Elsevier Science B.V.