About: The buffer minimization problem for multiprocessor scheduling with conflicts.     Goto   Sponge   NotDistinct   Permalink

An Entity of Type : http://linked.opendata.cz/ontology/domain/vavai/Vysledek, within Data Space : linked.opendata.cz associated with source document(s)

AttributesValues
rdf:type
Description
  • Our objective is to schedule task execution, obeying the conflict constraints, and minimizing the maximum buffer size of all processors. In the on-line case, we provide the following results: (i) a competitive algorithm for general graphs, (ii) tight bounds on the competitive ratios for cliques and complete $k$-partite graphs, and (iii) a $(Delta/2+1)$-competitive algorithm for trees, where $Delta$ is the diameter.
  • Our objective is to schedule task execution, obeying the conflict constraints, and minimizing the maximum buffer size of all processors. In the on-line case, we provide the following results: (i) a competitive algorithm for general graphs, (ii) tight bounds on the competitive ratios for cliques and complete $k$-partite graphs, and (iii) a $(Delta/2+1)$-competitive algorithm for trees, where $Delta$ is the diameter. (en)
Title
  • The buffer minimization problem for multiprocessor scheduling with conflicts.
  • The buffer minimization problem for multiprocessor scheduling with conflicts. (en)
skos:prefLabel
  • The buffer minimization problem for multiprocessor scheduling with conflicts.
  • The buffer minimization problem for multiprocessor scheduling with conflicts. (en)
skos:notation
  • RIV/67985840:_____/01:05025170!RIV/2003/AV0/A05003/N
http://linked.open.../vavai/riv/strany
  • 862;874
http://linked.open...avai/riv/aktivita
http://linked.open...avai/riv/aktivity
  • P(GA201/97/P038), P(IAA1019901), P(LN00A056), Z(AV0Z1019905)
http://linked.open...vai/riv/dodaniDat
http://linked.open...aciTvurceVysledku
http://linked.open.../riv/druhVysledku
http://linked.open...iv/duvernostUdaju
http://linked.open...titaPredkladatele
http://linked.open...dnocenehoVysledku
  • 674761
http://linked.open...ai/riv/idVysledku
  • RIV/67985840:_____/01:05025170
http://linked.open...riv/jazykVysledku
http://linked.open.../riv/klicovaSlova
  • online algorithms%scheduling%conflict graph (en)
http://linked.open.../riv/klicoveSlovo
http://linked.open...ontrolniKodProRIV
  • [2C7703E854EA]
http://linked.open...v/mistoKonaniAkce
  • Crete [GR]
http://linked.open...i/riv/mistoVydani
  • Berlin
http://linked.open...i/riv/nazevZdroje
  • Proceedings of the 28th International Colloquium on Automata, Languages, and Programming.
http://linked.open...in/vavai/riv/obor
http://linked.open...ichTvurcuVysledku
http://linked.open...cetTvurcuVysledku
http://linked.open...ocetUcastnikuAkce
http://linked.open...nichUcastnikuAkce
http://linked.open...vavai/riv/projekt
http://linked.open...UplatneniVysledku
http://linked.open...iv/tvurceVysledku
  • Sgall, Jiří
  • Noga, J.
  • Woeginger, G. J.
  • Chrobák, M.
  • Csirik, J.
  • Imreh, C.
http://linked.open...vavai/riv/typAkce
http://linked.open.../riv/zahajeniAkce
http://linked.open...n/vavai/riv/zamer
number of pages
http://purl.org/ne...btex#hasPublisher
  • Springer-Verlag
Faceted Search & Find service v1.16.118 as of Jun 21 2024


Alternative Linked Data Documents: ODE     Content Formats:   [cxml] [csv]     RDF   [text] [turtle] [ld+json] [rdf+json] [rdf+xml]     ODATA   [atom+xml] [odata+json]     Microdata   [microdata+json] [html]    About   
This material is Open Knowledge   W3C Semantic Web Technology [RDF Data] Valid XHTML + RDFa
OpenLink Virtuoso version 07.20.3240 as of Jun 21 2024, on Linux (x86_64-pc-linux-gnu), Single-Server Edition (126 GB total memory, 48 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software