{"id":"https://openalex.org/W2157218222","doi":"https://doi.org/10.1109/icpads.2007.4447832","title":"Scheduling algorithm for multi-item requests with time constraints in mobile computing environments","display_name":"Scheduling algorithm for multi-item requests with time constraints in mobile computing environments","publication_year":2007,"publication_date":"2007-01-01","ids":{"openalex":"https://openalex.org/W2157218222","doi":"https://doi.org/10.1109/icpads.2007.4447832","mag":"2157218222"},"language":"en","primary_location":{"id":"doi:10.1109/icpads.2007.4447832","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icpads.2007.4447832","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2007 International Conference on Parallel and Distributed Systems","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5100765413","display_name":"Jun Chen","orcid":"https://orcid.org/0000-0003-3265-0318"},"institutions":[{"id":"https://openalex.org/I37461747","display_name":"Wuhan University","ror":"https://ror.org/033vjfk17","country_code":"CN","type":"education","lineage":["https://openalex.org/I37461747"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Jun Chen","raw_affiliation_strings":["School of Computer Science, Wuhan University of China, Wuhan, Hubei, China"],"affiliations":[{"raw_affiliation_string":"School of Computer Science, Wuhan University of China, Wuhan, Hubei, China","institution_ids":["https://openalex.org/I37461747"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5053498754","display_name":"Ganping Huang","orcid":null},"institutions":[{"id":"https://openalex.org/I37461747","display_name":"Wuhan University","ror":"https://ror.org/033vjfk17","country_code":"CN","type":"education","lineage":["https://openalex.org/I37461747"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Ganping Huang","raw_affiliation_strings":["School of Computer Science, Wuhan University of China, Wuhan, Hubei, China"],"affiliations":[{"raw_affiliation_string":"School of Computer Science, Wuhan University of China, Wuhan, Hubei, China","institution_ids":["https://openalex.org/I37461747"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5069245903","display_name":"Victor C. S. Lee","orcid":"https://orcid.org/0000-0003-2596-1257"},"institutions":[{"id":"https://openalex.org/I168719708","display_name":"City University of Hong Kong","ror":"https://ror.org/03q8dnn23","country_code":"HK","type":"education","lineage":["https://openalex.org/I168719708"]}],"countries":["HK"],"is_corresponding":false,"raw_author_name":"Victor C.S. Lee","raw_affiliation_strings":["Department of Computer Science, City University of Hong Kong, Kowloon, Hong Kong, China"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, City University of Hong Kong, Kowloon, Hong Kong, China","institution_ids":["https://openalex.org/I168719708"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5100765413"],"corresponding_institution_ids":["https://openalex.org/I37461747"],"apc_list":null,"apc_paid":null,"fwci":0.9626,"has_fulltext":false,"cited_by_count":12,"citation_normalized_percentile":{"value":0.80031933,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":94,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"7"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10772","display_name":"Distributed systems and fault tolerance","score":0.9994999766349792,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10772","display_name":"Distributed systems and fault tolerance","score":0.9994999766349792,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10715","display_name":"Distributed and Parallel Computing Systems","score":0.9980000257492065,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11478","display_name":"Caching and Content Delivery","score":0.9884999990463257,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.88457190990448},{"id":"https://openalex.org/keywords/scalability","display_name":"Scalability","score":0.6448785662651062},{"id":"https://openalex.org/keywords/fair-share-scheduling","display_name":"Fair-share scheduling","score":0.6019763350486755},{"id":"https://openalex.org/keywords/dynamic-priority-scheduling","display_name":"Dynamic priority scheduling","score":0.5872689485549927},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5799868702888489},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.5774504542350769},{"id":"https://openalex.org/keywords/rate-monotonic-scheduling","display_name":"Rate-monotonic scheduling","score":0.4518614709377289},{"id":"https://openalex.org/keywords/atomic-broadcast","display_name":"Atomic broadcast","score":0.41488519310951233},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3935145139694214},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.38509753346443176},{"id":"https://openalex.org/keywords/real-time-computing","display_name":"Real-time computing","score":0.3414645791053772},{"id":"https://openalex.org/keywords/broadcasting","display_name":"Broadcasting (networking)","score":0.1498943269252777},{"id":"https://openalex.org/keywords/quality-of-service","display_name":"Quality of service","score":0.10771027207374573},{"id":"https://openalex.org/keywords/database","display_name":"Database","score":0.0902608335018158},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.08866950869560242}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.88457190990448},{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.6448785662651062},{"id":"https://openalex.org/C31689143","wikidata":"https://www.wikidata.org/wiki/Q733809","display_name":"Fair-share scheduling","level":3,"score":0.6019763350486755},{"id":"https://openalex.org/C107568181","wikidata":"https://www.wikidata.org/wiki/Q5319000","display_name":"Dynamic priority scheduling","level":3,"score":0.5872689485549927},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5799868702888489},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.5774504542350769},{"id":"https://openalex.org/C127456818","wikidata":"https://www.wikidata.org/wiki/Q238879","display_name":"Rate-monotonic scheduling","level":4,"score":0.4518614709377289},{"id":"https://openalex.org/C943373","wikidata":"https://www.wikidata.org/wiki/Q4817323","display_name":"Atomic broadcast","level":3,"score":0.41488519310951233},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3935145139694214},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.38509753346443176},{"id":"https://openalex.org/C79403827","wikidata":"https://www.wikidata.org/wiki/Q3988","display_name":"Real-time computing","level":1,"score":0.3414645791053772},{"id":"https://openalex.org/C110157686","wikidata":"https://www.wikidata.org/wiki/Q922122","display_name":"Broadcasting (networking)","level":2,"score":0.1498943269252777},{"id":"https://openalex.org/C5119721","wikidata":"https://www.wikidata.org/wiki/Q220501","display_name":"Quality of service","level":2,"score":0.10771027207374573},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.0902608335018158},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.08866950869560242},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/icpads.2007.4447832","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icpads.2007.4447832","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2007 International Conference on Parallel and Distributed Systems","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":20,"referenced_works":["https://openalex.org/W1498726528","https://openalex.org/W1535125202","https://openalex.org/W1538443595","https://openalex.org/W1588551550","https://openalex.org/W2007692652","https://openalex.org/W2049712551","https://openalex.org/W2102299413","https://openalex.org/W2104669433","https://openalex.org/W2116882484","https://openalex.org/W2129497881","https://openalex.org/W2149722782","https://openalex.org/W2151596065","https://openalex.org/W2168689656","https://openalex.org/W2169061381","https://openalex.org/W4237086396","https://openalex.org/W6632257379","https://openalex.org/W6635185701","https://openalex.org/W6675927217","https://openalex.org/W6684518887","https://openalex.org/W6684831943"],"related_works":["https://openalex.org/W2184166483","https://openalex.org/W2397293317","https://openalex.org/W2377713709","https://openalex.org/W2225350526","https://openalex.org/W2373973180","https://openalex.org/W2372008037","https://openalex.org/W2167574351","https://openalex.org/W3036719625","https://openalex.org/W2367142822","https://openalex.org/W4390722068"],"abstract_inverted_index":{"On-demand":[0],"broadcast":[1,27,50,132],"is":[2,99,109],"an":[3],"effective":[4],"wireless":[5],"data":[6,26,38,93],"dissemination":[7],"technique":[8],"to":[9,15,78,111],"enhance":[10],"system":[11],"scalability":[12],"and":[13,67,96],"capability":[14],"handle":[16],"dynamic":[17],"user":[18],"access":[19],"patterns.":[20],"Previous":[21],"studies":[22],"on":[23],"time-critical":[24,52],"on-demand":[25],"were":[28],"under":[29,115],"the":[30,48,60,90,106],"assumption":[31],"that":[32,69,88,105],"each":[33],"client":[34],"requests":[35,81],"only":[36,123],"one":[37],"item":[39,72,94],"at":[40],"a":[41,84,116],"time.":[42],"Little":[43],"work,":[44],"however,":[45],"has":[46],"considered":[47],"ondemand":[49],"with":[51],"multi-item":[53,80],"requests.":[54],"In":[55],"this":[56,64],"paper,":[57],"we":[58],"study":[59],"problem":[61],"arising":[62],"in":[63],"new":[65,85],"environment":[66],"observe":[68],"existing":[70],"single":[71],"based":[73],"scheduling":[74,86,95,98],"algorithms":[75,114],"are":[76],"unable":[77],"manage":[79],"efficiently.":[82],"Thus,":[83],"algorithm":[87,108,121],"combines":[89],"benefit":[91],"of":[92,118,127],"request":[97],"proposed.":[100],"The":[101],"performance":[102],"results":[103],"show":[104],"proposed":[107],"superior":[110],"other":[112],"classical":[113],"variety":[117],"factors.":[119],"Our":[120],"not":[122],"reduces":[124],"deadline-missing":[125],"ratio":[126],"requests,":[128],"but":[129],"also":[130],"saves":[131],"channel":[133],"bandwidth.":[134]},"counts_by_year":[{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":2},{"year":2013,"cited_by_count":3}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}