Work Function Algorithm with a Moving Window for Solving the On-Line k-Server Problem

We consider a modification of the well known work function algorithm (WFA) for solving the on-line k -server problem. Our modified WFA is based on a moving window, i.e. on the approximate work function that takes into account only a fixed number of most recent on-line requests. The main motivation f...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:Proceedings of the ITI 2007 : 29th International Conference on Information Technology Interfaces : ITI 2007 : June 25-28, 2007, Cavtat/Dubrovnik, Croatia s. 591 - 596
Hlavní autori: Baumgartner, A., Manger, R., Hocenski, Z.
Médium: Konferenčný príspevok..
Jazyk:English
Vydavateľské údaje: Zagreb IEEE 01.06.2007
University Computing Centre
Predmet:
Algorithmics. Computability. Computer arithmetics
Applied sciences
Approximation algorithms
Computational complexity
Computer science; control theory; systems
Computer systems and distributed systems. User interface
Cost function
Decision making
Degradation
Exact sciences and technology
experiments
Gain control
Information technology
Mathematics
moving windows
on-line algorithms
on-line problems
Optimized production technology
Software
the k-server problem
the work function algorithm (WFA)
Theoretical computing
K server problem
Computational complexity
Distributed system
ISBN:9537138097, 9789537138097
ISSN:1330-1012
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Abstract We consider a modification of the well known work function algorithm (WFA) for solving the on-line k -server problem. Our modified WFA is based on a moving window, i.e. on the approximate work function that takes into account only a fixed number of most recent on-line requests. The main motivation for using a moving window is to gain control over the prohibitive computational complexity imposed by the original algorithm. Experimental results are presented, where the performance of the modified WFA has been compared vs. the original WFA.
AbstractList We consider a modification of the well known work function algorithm (WFA) for solving the on-line k -server problem. Our modified WFA is based on a moving window, i.e. on the approximate work function that takes into account only a fixed number of most recent on-line requests. The main motivation for using a moving window is to gain control over the prohibitive computational complexity imposed by the original algorithm. Experimental results are presented, where the performance of the modified WFA has been compared vs. the original WFA.
Author Baumgartner, A.
Manger, R.
Hocenski, Z.
Author_xml – sequence: 1
  givenname: A.
  surname: Baumgartner
  fullname: Baumgartner, A.
  organization: Univ. of Osijek, Osijek
– sequence: 2
  givenname: R.
  surname: Manger
  fullname: Manger, R.
– sequence: 3
  givenname: Z.
  surname: Hocenski
  fullname: Hocenski, Z.
BackLink http://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=22470859$$DView record in Pascal Francis
BookMark eNo9UE1rAjEQTamFqvVe6CWXHtdOPtZsjiK1FSwWVDxK3J1o6ppIdqv033ep0nkwj_fmMQzTIS0fPBLyyKDPGOiXyWLS5wCqL3kmGtyQnlaZToViImMgbknnKkCrFmkzISBhwPg96VXVFzQldMoZtMlyFeKejr99Xrvg6bDchujq3YGem04N_Qgn57d05XwRztSGSOeh_LPqHdKZT6bOI90nc4wnjPQzhk2JhwdyZ01ZYe_KXbIcvy5G78l09jYZDaeJ45DWiVRMK7tpzsNBlnFd8FwqVI1RoBlIPZCQg8zTQgJCLixaUyiZWplZJaXeiC55vuw9mio3pY3G565aH6M7mPiz5lwqyFLd5J4uOYeI_-Pr98Qv5CVhGA
ContentType Conference Proceeding
Copyright 2015 INIST-CNRS
Copyright_xml – notice: 2015 INIST-CNRS
DBID 6IE
6IL
CBEJK
RIE
RIL
IQODW
DOI 10.1109/ITI.2007.4283838
DatabaseName IEEE Electronic Library (IEL) Conference Proceedings
IEEE Xplore POP ALL
IEEE Xplore All Conference Proceedings
IEEE Electronic Library (IEL)
IEEE Proceedings Order Plans (POP All) 1998-Present
Pascal-Francis
DatabaseTitleList
Database_xml – sequence: 1
  dbid: RIE
  name: IEEE Electronic Library (IEL)
  url: https://ieeexplore.ieee.org/
  sourceTypes: Publisher
DeliveryMethod fulltext_linktorsrc
Discipline Engineering
Mathematics
Applied Sciences
EISBN 9789537138103
9537138100
EndPage 596
ExternalDocumentID 22470859
4283838
Genre orig-research
GroupedDBID 6IE
6IF
6IK
6IL
6IN
AAJGR
AARBI
AAWTH
ALMA_UNASSIGNED_HOLDINGS
BEFXN
BFFAM
BGNUA
BKEBE
BPEOZ
CBEJK
IERZE
OCL
RIE
RIL
IQODW
ID FETCH-LOGICAL-i205t-47197fb133e68829d2c47e7b13dea649640c04c5d40e0c3fefad745f48f7449b3
IEDL.DBID RIE
ISBN 9537138097
9789537138097
ISICitedReferencesCount 0
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000248942200095&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN 1330-1012
IngestDate Wed Apr 02 07:17:04 EDT 2025
Wed Aug 27 02:00:26 EDT 2025
IsPeerReviewed false
IsScholarly true
Keywords K server problem
Computational complexity
Distributed system
Language English
License CC BY 4.0
LinkModel DirectLink
MeetingName ITI 2007 : proceedings of the 29th international conference on information technology interfaces (Cavtat, 25-28 June 2007)
MergedId FETCHMERGED-LOGICAL-i205t-47197fb133e68829d2c47e7b13dea649640c04c5d40e0c3fefad745f48f7449b3
PageCount 6
ParticipantIDs pascalfrancis_primary_22470859
ieee_primary_4283838
PublicationCentury 2000
PublicationDate 2007-June
2007
PublicationDateYYYYMMDD 2007-06-01
2007-01-01
PublicationDate_xml – month: 06
  year: 2007
  text: 2007-June
PublicationDecade 2000
PublicationPlace Zagreb
PublicationPlace_xml – name: Zagreb
PublicationTitle Proceedings of the ITI 2007 : 29th International Conference on Information Technology Interfaces : ITI 2007 : June 25-28, 2007, Cavtat/Dubrovnik, Croatia
PublicationTitleAbbrev ITI
PublicationYear 2007
Publisher IEEE
University Computing Centre
Publisher_xml – name: IEEE
– name: University Computing Centre
SSID ssj0000395210
ssib002089391
ssib003012261
ssib000986468
ssib005283003
ssib001418696
ssib002806550
Score 1.6491008
Snippet We consider a modification of the well known work function algorithm (WFA) for solving the on-line k -server problem. Our modified WFA is based on a moving...
SourceID pascalfrancis
ieee
SourceType Index Database
Publisher
StartPage 591
SubjectTerms Algorithmics. Computability. Computer arithmetics
Applied sciences
Approximation algorithms
Computational complexity
Computer science; control theory; systems
Computer systems and distributed systems. User interface
Cost function
Decision making
Degradation
Exact sciences and technology
experiments
Gain control
Information technology
Mathematics
moving windows
on-line algorithms
on-line problems
Optimized production technology
Software
the k-server problem
the work function algorithm (WFA)
Theoretical computing
Title Work Function Algorithm with a Moving Window for Solving the On-Line k-Server Problem
URI https://ieeexplore.ieee.org/document/4283838
WOSCitedRecordID wos000248942200095&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1LT8MwDI5g4gAX3uKtHDhSSFc3jyNCTCDxkgDBDTWNAxOjRduAv4_TdqNIXFAvTao2lZvGn-34M2P7qbFogf7vTGUyAiVNlEnfjZz1YH2irXIVZf6FurrSj4_mZoYdTHNhELHafIaH4bSK5bsy_wiusqNADkbHLJtVSta5Wi2ooCW0oHMModhSCzoL0symnbNJyjdtQ-eYkEiLqiowYzURympVTwxpujrpOBFRoMUiI8-kCVl5WtT0gkr_tCchUWGOzu_Oa67E5v2bQi5hG2Y2oi_h6xIaLb3WW_yfRJbY2k-CIL-Zqr5lNoPFCltocRtS63JKCDtaZffBKc97pETDRODHg-dy2B-_vPHgB-YZv6wcG_yhX7jyixOQ5rfloOqih_DrIiKbGflrFJY2HIaxQxmcNXbfO707OYuaig5RvyvSMc2F2ChvSYIoCdob181BoaIOh5kEI0HkAvLUgUCRJx595hSkHrRXAMYm66xTlAVuMC40kiWaWoKoFsiM1XniNNjYkwEaI8hNthrE9fRek3Y8NZLaZHu_hD69TlBGBbK3rb_v22bzk52CIt5hnfHwA3fZXP457o-Ge9VU_AZUqM27
linkProvider IEEE
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1RT9swED4BQ2K8jA2mARvzwx4XcJpLbD9OaBUVbYe0Inir4vgM1VgytQX-_s5JKEHay5SX2FFi5eL4vrvzfQfwJTWWLPL_nas8i1BlJsoz34uc9Wh9oq1yNWX-UI3H-vraXKzB11UuDBHVm8_oOJzWsXxXFffBVXYSyMH4WIdXKWJPNtlaHbCgM-yA5xhDuaUOeJasm003a5PVb9oFzzFjkQ5ZVeDGamOU9bqeGNZ1TdpxIqNAjMVmnkkTtvO0bAgGlX5uPwVFpTkZTAYNW2L7Bm0pl7ARM1_wt_BNEY2OZuu_-T-Z7MDec4qguFgpv7ewRuU72O6wG3JrtKKEXezCZXDLiz6r0TAVxLe7m2o-W97-FsETLHIxql0b4mpWuupRMJQWP6u7uosfIn6UEVvNJH5FYXGjeRg7FMLZg8v-98npWdTWdIhmPZkueTbERnnLEqSMwb1xvQIVKe5wlGdoMpSFxCJ1KEkWiSefO4WpR-0VorHJe9goq5I-gJCa2BZNLYNUi2zI6iJxGm3s2QSNCbN92A3imv5paDumraT24eiF0FfXGcyoQPd28O_7PsPW2WQ0nA4H4_NDeP20b1DGH2FjOb-nT7BZPCxni_lRPS3_AkGA0QI
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=proceeding&rft.title=Proceedings+of+the+ITI+2007+%3A+29th+International+Conference+on+Information+Technology+Interfaces+%3A+ITI+2007+%3A+June+25-28%2C+2007%2C+Cavtat%2FDubrovnik%2C+Croatia&rft.atitle=Work+Function+Algorithm+with+a+Moving+Window+for+Solving+the+On-Line+k-Server+Problem&rft.au=Baumgartner%2C+A.&rft.au=Manger%2C+R.&rft.au=Hocenski%2C+Z.&rft.date=2007-06-01&rft.pub=IEEE&rft.isbn=9789537138097&rft.issn=1330-1012&rft.spage=591&rft.epage=596&rft_id=info:doi/10.1109%2FITI.2007.4283838&rft.externalDocID=4283838
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1330-1012&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1330-1012&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1330-1012&client=summon