Pregled bibliografske jedinice broj: 398219
A fast implementation of the optimal off-line algorithm for solving the k-server problem
A fast implementation of the optimal off-line algorithm for solving the k-server problem // Mathematical communications, 14 (2009), 1; 123-138 (međunarodna recenzija, članak, znanstveni)
CROSBI ID: 398219 Za ispravke kontaktirajte CROSBI podršku putem web obrasca
Naslov
A fast implementation of the optimal off-line algorithm for solving the k-server problem
Autori
Rudec, Tomislav ; Baumgartner, Alfonzo ; Manger, Robert
Izvornik
Mathematical communications (1331-0623) 14
(2009), 1;
123-138
Vrsta, podvrsta i kategorija rada
Radovi u časopisima, članak, znanstveni
Ključne riječi
k-server problem; off-line algorithms; on-line algorithms; optimality; implementation; network flows; execution time; experiments
Sažetak
The optimal off-line algorithm for solving the k-server problem is usually implemented by network flows. In this paper, we first propose certain modifications to each step of the original network-flow implementation. Next, by experiments we demonstrate that the proposed modifications improve the speed of the algorithm. Finally, we investigate how similar ideas for improvement can also be applied to some related on-line algorithms.
Izvorni jezik
Engleski
Znanstvena područja
Matematika, Računarstvo
POVEZANOST RADA
Projekti:
037-0362980-2774 - Distribuirani algoritmi za pronalaženje optimalnih putova u grafovima (Manger, Robert, MZOS ) ( CroRIS)
Ustanove:
Prirodoslovno-matematički fakultet, Matematički odjel, Zagreb,
Fakultet elektrotehnike, računarstva i informacijskih tehnologija Osijek
Citiraj ovu publikaciju:
Časopis indeksira:
- Web of Science Core Collection (WoSCC)
- Science Citation Index Expanded (SCI-EXP)
- SCI-EXP, SSCI i/ili A&HCI
- Scopus
Uključenost u ostale bibliografske baze podataka::
- INSPEC
- MathSciNet
- Zentrallblatt für Mathematik/Mathematical Abstracts
