On-line multi-threaded Scheduling

On-line scheduling problems are studied with jobs organized in a number of sequences called threads. Each job becomes available as soon as a scheduling decision is made on all preceding jobs in the same thread. We consider two different on-line paradigms. The first one models a sort of batch process...

Descripción completa

Guardado en:
Detalles Bibliográficos
Publicado: 2003
Materias:
Competitive analysis
Multiple threads
On-line algorithms
Scheduling problems
Algorithms
Constraint theory
Decision making
Information retrieval
Mathematical models
Problem solving
Program processors
Real time systems
Scheduling
Online systems
Acceso en línea:https://bibliotecadigital.exactas.uba.ar/collection/paper/document/paper_10946136_v6_n2_p167_Feuerstein
http://hdl.handle.net/20.500.12110/paper_10946136_v6_n2_p167_Feuerstein
Aporte de:
Biblioteca Digital - Facultad de Ciencias Exactas y Naturales (UBA) de Universidad de Buenos Aires

Ejemplares similares

Ejemplares similares