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 kserver 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 fo...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Journal of computing and information technology Ročník 15; číslo 4; s. 325 - 330
Hlavní autoři: Baumgartner, Alfonzo, Manger, Robert, Hocenski, eljko
Médium: Journal Article Konferenční příspěvek Paper
Jazyk:angličtina
Vydáno: Zagreb University Computing Centre 01.12.2007
Sveuciliste U Zagrebu
Fakultet elektrotehnike i računarstva Sveučilišta u Zagrebu
Témata:
Algorithms
Analysis
Applied sciences
Computer science; control theory; systems
Computer systems and distributed systems. User interface
Exact sciences and technology
Software
United States
K server problem
Work function
Motivation
experiments
on-line algorithms
Windows
Distributed system
moving windows
on-line problems
Computational complexity
work function algorithm (WFA)
k- server problem
ISSN:1330-1136, 1846-3908
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Abstract We consider a modification of the well known work function algorithm (WFA) for solving the on-line kserver 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 kserver 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.
Audience Academic
Author Manger, Robert
Baumgartner, Alfonzo
Hocenski, eljko
Author_xml – sequence: 1
  givenname: Alfonzo
  surname: Baumgartner
  fullname: Baumgartner, Alfonzo
– sequence: 2
  givenname: Robert
  surname: Manger
  fullname: Manger, Robert
– sequence: 3
  givenname: eljko
  surname: Hocenski
  fullname: Hocenski, eljko
BackLink http://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=19995662$$DView record in Pascal Francis
BookMark eNptkV9LIzEUxYMorFt92i8QkH1YdGrSSdLJYxFdBUVZV3wMt3cybbYziSTjn_32po4IFRNILoffuVzu-U62ffCWkB-cjSdCV8fo-jFnjHPBtsgur4QqSs2q7VyXJSs4L9U3sp_SP5ZPqZUSfJfc3Ye4omePHnsXPJ21ixBdv-zoc34p0Kvw5PyC3jtfh2fahEhvQ_sm9UtLr33ROm_pqkg2PtlIb2KYt7bbIzsNtMnuv_8jcnd2-vfkvLi8_n1xMrsssJR5JItsDji3HJjFulE1R11bWXMFJVNKaYkCWKUYSCFAVk01lRPLsQY1l0pgOSJHQ99lRFiZh-g6iP9NAGcGJUW0uTRCqLyEETkY8AW01jjfhD4Cdi6hmfGpYmI6lTpT4y-ofGvbOcw7b1zWNwy_NgyZ6e1Lv4DHlMzF7Z9N9ufAPkBCaJsIHl36mJxrraVSk8zxgcMYUoq2MTleWGeUh3Gt4cysQ1-r5j307Dn85Plo-wX9Cpp5rXQ
CODEN CJCTEM
CitedBy_id crossref_primary_10_1007_s00453_019_00638_w
Cites_doi 10.1137/0404017
10.1016/j.tcs.2004.06.001
10.1016/0196-6774(90)90003-W
10.1145/2786.2793
ContentType Journal Article
Conference Proceeding
Paper
Copyright 2008 INIST-CNRS
COPYRIGHT 2007 Sveuciliste U Zagrebu
Copyright_xml – notice: 2008 INIST-CNRS
– notice: COPYRIGHT 2007 Sveuciliste U Zagrebu
DBID AAYXX
CITATION
IQODW
ISR
VP8
DOI 10.2498/cit.1001140
DatabaseName CrossRef
Pascal-Francis
Gale In Context: Science
Portal of Croatian Scientific and Professional Journals – HRČAK
DatabaseTitle CrossRef
DatabaseTitleList
DeliveryMethod fulltext_linktorsrc
Discipline Computer Science
Applied Sciences
EISSN 1846-3908
EndPage 330
ExternalDocumentID oai_hrcak_srce_hr_44613
A176047759
19995662
10_2498_cit_1001140
GeographicLocations United States
GeographicLocations_xml – name: United States
GroupedDBID .4S
.DC
29B
29K
2WC
5GY
5VS
77I
AAYXX
ADMLS
ALMA_UNASSIGNED_HOLDINGS
ARCSS
BAIFH
BBTPI
CITATION
CS3
D-I
DU5
E3Z
EBS
EDO
EJD
EN8
EOJEC
GROUPED_DOAJ
I-F
IAO
ICD
IPNFZ
ISR
ITC
IVC
KQ8
KWQ
MK~
ML~
M~E
OBODZ
OK1
OVT
P2P
PV9
RIG
RZL
TR2
TUS
VP8
XH6
IQODW
4S
ADACO
ICW
ID FETCH-LOGICAL-c3530-ec0bacbe1a0ecdf6d1c9de5d16a3066695c4a0860a544a58f8752e1cda6b564c3
ISSN 1330-1136
IngestDate Tue Oct 06 19:29:41 EDT 2020
Mon Oct 20 23:16:07 EDT 2025
Mon Oct 20 17:14:35 EDT 2025
Thu Oct 16 16:19:27 EDT 2025
Mon Jul 21 09:14:09 EDT 2025
Tue Nov 18 21:28:33 EST 2025
Sat Nov 29 04:13:44 EST 2025
IsDoiOpenAccess true
IsOpenAccess true
IsPeerReviewed true
IsScholarly true
Issue 4
Keywords K server problem
Work function
Motivation
experiments
on-line algorithms
Windows
Distributed system
moving windows
on-line problems
Computational complexity
work function algorithm (WFA)
k- server problem
Language English
License CC BY 4.0
cc-by-nd: openAccess
LinkModel OpenURL
MeetingName ITI (Information Technology Interfaces) 2007 Conference
MergedId FETCHMERGED-LOGICAL-c3530-ec0bacbe1a0ecdf6d1c9de5d16a3066695c4a0860a544a58f8752e1cda6b564c3
Notes 44613
OpenAccessLink https://hrcak.srce.hr/44613
PageCount 6
ParticipantIDs hrcak_primary_oai_hrcak_srce_hr_44613
gale_infotracmisc_A176047759
gale_infotracacademiconefile_A176047759
gale_incontextgauss_ISR_A176047759
pascalfrancis_primary_19995662
crossref_citationtrail_10_2498_cit_1001140
crossref_primary_10_2498_cit_1001140
ProviderPackageCode VP8
PublicationCentury 2000
PublicationDate 20071201
PublicationDateYYYYMMDD 2007-12-01
PublicationDate_xml – month: 12
  year: 2007
  text: 20071201
  day: 01
PublicationDecade 2000
PublicationPlace Zagreb
PublicationPlace_xml – name: Zagreb
PublicationTitle Journal of computing and information technology
PublicationYear 2007
Publisher University Computing Centre
Sveuciliste U Zagrebu
Fakultet elektrotehnike i računarstva Sveučilišta u Zagrebu
Publisher_xml – name: University Computing Centre
– name: Sveuciliste U Zagrebu
– name: Fakultet elektrotehnike i računarstva Sveučilišta u Zagrebu
References (ref2) 2004
ref1
Chrobak (ref3) 1991; 4
Irani (ref4) 1997
ref6
ref5
References_xml – volume: 4
  start-page: 172
  issn: 0895-4801
  year: 1991
  ident: ref3
  article-title: H. KARLOFF, T. H. PAYNE, S. VISHWANATHAN, New results on server problems.
  publication-title: SIAM J. Discrete Math.
  doi: 10.1137/0404017
– volume-title: M. S. BAZARAA, J. J. JARVIS, H.D. SHERALI, Linear Programming and Network Flows.
  year: 2004
  ident: ref2
– ident: ref1
  doi: 10.1016/j.tcs.2004.06.001
– ident: ref5
  doi: 10.1016/0196-6774(90)90003-W
– ident: ref6
  doi: 10.1145/2786.2793
– start-page: 521
  volume-title: Approximation Algorithms for NP-Hard Problems
  year: 1997
  ident: ref4
  article-title: Online computation.
SSID ssj0000396641
Score 1.6717614
Snippet We consider a modification of the well known work function algorithm (WFA) for solving the on-line kserver problem. Our modified WFA is based on a moving...
SourceID hrcak
gale
pascalfrancis
crossref
SourceType Open Access Repository
Aggregation Database
Index Database
Enrichment Source
StartPage 325
SubjectTerms Algorithms
Analysis
Applied sciences
Computer science; control theory; systems
Computer systems and distributed systems. User interface
Exact sciences and technology
Software
Title Work Function Algorithm with a Moving Window for Solving the On-line k-server Problem
URI https://hrcak.srce.hr/44613
Volume 15
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
journalDatabaseRights – providerCode: PRVHPJ
  databaseName: ROAD: Directory of Open Access Scholarly Resources
  customDbUrl:
  eissn: 1846-3908
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0000396641
  issn: 1330-1136
  databaseCode: M~E
  dateStart: 20000101
  isFulltext: true
  titleUrlDefault: https://road.issn.org
  providerName: ISSN International Centre
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV1Lb9NAEF5FLQdOvIoIlGqFipCQLOzs-nWMohYqaFqRVvRmrdfrNsTYlZ2GigN_hb_K7MMbO1RCHLhEzmYU2zufd2bWM98gtB-AFwKGMnAYWHuHppnnxH4knHwUuakviMiZ4pn9FE6n0cVFfDoY_GprYVZFWJbR7W18_V9VDWOgbFk6-w_qtn8KA3AMSodPUDt8_qn4O-1Px8nkqmlDW4hoWFKVypcbe-qGyVsyOB2CrVMy4-KyqufLq2-mBA5WALX_8AUC-eq7ylCcVcWqrbg6KR3ltC4cudUralmFILvV2JB_fH78Hhzoqc6-GBd5Vf6orMrHNi1DZXtbwJ1MDqazj0fqNYoovi6q3k5FuJH10ck0mdibV3vYorMAE-I6ss9Mb4X2O0ikneWW6KJpY7mJfsOzaRQgwJSFDny-VIRTnqaH6lNvb5hEm6goSRrA4QUbvz0iQSSX0OOf6008l0C0SHVQb65b14DKc77rnLHn9Rjbv31Vc7aQybisgecx141UOt7N2UO0s677xKcWUY_QQJSP0QMTqGBjBhoYanuBtGNP0LlEDm6Rgy1ysEQOZlgjB2vkYEAONsjBgBxskINb5GCDnB10fnhwNvngmJYdDic-zIDgbsp4KjzmCp7lQebxOBN-5gWMyEg59jllEEW7zKeU-VEO4fJIeDxjQeoHlJOnaKusSvEMYZd73MtYGqYQVYxGGYMv1MsyTrnLiIiG6G07pQk3fPayrUqRQFwr51-OJmb-h2jfCl9rGpe7xV5J3SSSGKWUmVeX7KZpkqPZ52TshYFLw9CPh-iNEcorOCFnppAFLltyqfUkd3uSsHLz3s-vFQTsFUmqdz3S1FzAYUIpuNtDtNeDyPoODDqf_03gBbq_fiB30dayvhEv0T2-Ws6bek9h-jelf9F0
linkProvider ISSN International Centre
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%3Ajournal&rft.genre=proceeding&rft.title=Journal+of+computing+and+information+technology&rft.atitle=Work+Function+Algorithm+with+a+Moving+Window+for+Solving+the+On-line+k-server+Problem&rft.au=BAUMGARTNER%2C+Alfonzo&rft.au=MANGER%2C+Robert&rft.au=HOCENSKI%2C+Zeljko&rft.date=2007-12-01&rft.pub=University+Computing+Centre&rft.issn=1330-1136&rft.volume=15&rft.issue=4&rft.spage=325&rft.epage=330&rft_id=info:doi/10.2498%2Fcit.1001140&rft.externalDBID=n%2Fa&rft.externalDocID=19995662
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1330-1136&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1330-1136&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1330-1136&client=summon