{"id":"https://openalex.org/W2088419592","doi":"https://doi.org/10.1145/1330598.1330613","title":"Simulation of dynamic priority calculation for multilevel priority queue","display_name":"Simulation of dynamic priority calculation for multilevel priority queue","publication_year":2007,"publication_date":"2007-01-01","ids":{"openalex":"https://openalex.org/W2088419592","doi":"https://doi.org/10.1145/1330598.1330613","mag":"2088419592"},"language":"en","primary_location":{"id":"doi:10.1145/1330598.1330613","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1330598.1330613","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2007 international conference on Computer systems and technologies  - CompSysTech '07","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/A5062556173","display_name":"Ivaylo Atanassov","orcid":null},"institutions":[{"id":"https://openalex.org/I31151848","display_name":"Technical University of Sofia","ror":"https://ror.org/052prhs50","country_code":"BG","type":"education","lineage":["https://openalex.org/I31151848"]}],"countries":["BG"],"is_corresponding":true,"raw_author_name":"Ivaylo Atanassov","raw_affiliation_strings":["Technical University -- Sofia"],"affiliations":[{"raw_affiliation_string":"Technical University -- Sofia","institution_ids":["https://openalex.org/I31151848"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5062556173"],"corresponding_institution_ids":["https://openalex.org/I31151848"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.19066124,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"1"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10974","display_name":"Advanced Queuing Theory Analysis","score":0.9994999766349792,"subfield":{"id":"https://openalex.org/subfields/1404","display_name":"Management Information Systems"},"field":{"id":"https://openalex.org/fields/14","display_name":"Business, Management and Accounting"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},"topics":[{"id":"https://openalex.org/T10974","display_name":"Advanced Queuing Theory Analysis","score":0.9994999766349792,"subfield":{"id":"https://openalex.org/subfields/1404","display_name":"Management Information Systems"},"field":{"id":"https://openalex.org/fields/14","display_name":"Business, Management and Accounting"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T10772","display_name":"Distributed systems and fault tolerance","score":0.9991000294685364,"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/T10138","display_name":"Network Traffic and Congestion Control","score":0.9986000061035156,"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/priority-queue","display_name":"Priority queue","score":0.8646235466003418},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.730036735534668},{"id":"https://openalex.org/keywords/priority-inheritance","display_name":"Priority inheritance","score":0.6834132671356201},{"id":"https://openalex.org/keywords/queue","display_name":"Queue","score":0.5897200703620911},{"id":"https://openalex.org/keywords/priority-ceiling-protocol","display_name":"Priority ceiling protocol","score":0.584429144859314},{"id":"https://openalex.org/keywords/deadline-monotonic-scheduling","display_name":"Deadline-monotonic scheduling","score":0.4607703387737274},{"id":"https://openalex.org/keywords/operations-research","display_name":"Operations research","score":0.3239133059978485},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.26164475083351135},{"id":"https://openalex.org/keywords/dynamic-priority-scheduling","display_name":"Dynamic priority scheduling","score":0.23011454939842224},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.1414472758769989},{"id":"https://openalex.org/keywords/round-robin-scheduling","display_name":"Round-robin scheduling","score":0.10572436451911926},{"id":"https://openalex.org/keywords/quality-of-service","display_name":"Quality of service","score":0.0806429386138916},{"id":"https://openalex.org/keywords/rate-monotonic-scheduling","display_name":"Rate-monotonic scheduling","score":0.06440877914428711}],"concepts":[{"id":"https://openalex.org/C26951474","wikidata":"https://www.wikidata.org/wiki/Q629283","display_name":"Priority queue","level":3,"score":0.8646235466003418},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.730036735534668},{"id":"https://openalex.org/C63160601","wikidata":"https://www.wikidata.org/wiki/Q253831","display_name":"Priority inheritance","level":5,"score":0.6834132671356201},{"id":"https://openalex.org/C160403385","wikidata":"https://www.wikidata.org/wiki/Q220543","display_name":"Queue","level":2,"score":0.5897200703620911},{"id":"https://openalex.org/C117420606","wikidata":"https://www.wikidata.org/wiki/Q386027","display_name":"Priority ceiling protocol","level":5,"score":0.584429144859314},{"id":"https://openalex.org/C76774629","wikidata":"https://www.wikidata.org/wiki/Q1146103","display_name":"Deadline-monotonic scheduling","level":5,"score":0.4607703387737274},{"id":"https://openalex.org/C42475967","wikidata":"https://www.wikidata.org/wiki/Q194292","display_name":"Operations research","level":1,"score":0.3239133059978485},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.26164475083351135},{"id":"https://openalex.org/C107568181","wikidata":"https://www.wikidata.org/wiki/Q5319000","display_name":"Dynamic priority scheduling","level":3,"score":0.23011454939842224},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.1414472758769989},{"id":"https://openalex.org/C175893541","wikidata":"https://www.wikidata.org/wiki/Q1196582","display_name":"Round-robin scheduling","level":4,"score":0.10572436451911926},{"id":"https://openalex.org/C5119721","wikidata":"https://www.wikidata.org/wiki/Q220501","display_name":"Quality of service","level":2,"score":0.0806429386138916},{"id":"https://openalex.org/C127456818","wikidata":"https://www.wikidata.org/wiki/Q238879","display_name":"Rate-monotonic scheduling","level":4,"score":0.06440877914428711}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/1330598.1330613","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1330598.1330613","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2007 international conference on Computer systems and technologies  - CompSysTech '07","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":8,"referenced_works":["https://openalex.org/W1540774993","https://openalex.org/W1573624842","https://openalex.org/W1916709771","https://openalex.org/W2029390211","https://openalex.org/W2127133848","https://openalex.org/W2261566496","https://openalex.org/W2751601659","https://openalex.org/W3145794233"],"related_works":["https://openalex.org/W1602037586","https://openalex.org/W2037055167","https://openalex.org/W2091447295","https://openalex.org/W2337893998","https://openalex.org/W2604560300","https://openalex.org/W2067749084","https://openalex.org/W2133311116","https://openalex.org/W2055420863","https://openalex.org/W2069990174","https://openalex.org/W2369535141"],"abstract_inverted_index":{"The":[0,87],"paper":[1],"introduces":[2],"the":[3,60,72,75,80],"simulation":[4],"results":[5],"for":[6,9,13,32],"a":[7,37,44],"formula":[8,57],"dynamic":[10],"priority":[11,15,46],"calculation":[12],"multilevel":[14,45],"queue.":[16],"Priority":[17],"queues":[18],"are":[19,83],"widely":[20],"used":[21,50],"data":[22],"structures,":[23],"especially":[24],"in":[25,51,94],"operating":[26],"systems.":[27],"Some":[28],"database":[29,54],"servers,":[30],"Oracle":[31],"example,":[33],"use":[34],"also":[35,66],"such":[36],"structures.":[38],"In":[39,68],"previous":[40],"work":[41],"is":[42,65,89],"introduced":[43],"queue,":[47,76],"called":[48],"CMPQ,":[49],"experimentally":[52],"developed":[53],"server.":[55],"A":[56],"to":[58,63,70,90],"calculate":[59],"next":[61],"queue":[62],"service":[64],"introduced.":[67],"order":[69],"examine":[71],"behaviour":[73],"of":[74,79],"some":[77],"simulations":[78],"scheduling":[81],"algorithm":[82],"performed":[84],"using":[85],"MatLab.":[86],"goal":[88],"assure":[91],"that":[92],"even":[93],"worst-case":[95],"situations":[96],"starvation":[97],"does":[98],"not":[99],"occurs.":[100]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}