{"id":"https://openalex.org/W2060012906","doi":"https://doi.org/10.1142/s0218213010000212","title":"NEW APPROACH TO MULTI-LEVEL PROCESSOR SCHEDULING","display_name":"NEW APPROACH TO MULTI-LEVEL PROCESSOR SCHEDULING","publication_year":2010,"publication_date":"2010-06-01","ids":{"openalex":"https://openalex.org/W2060012906","doi":"https://doi.org/10.1142/s0218213010000212","mag":"2060012906"},"language":"en","primary_location":{"id":"doi:10.1142/s0218213010000212","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0218213010000212","pdf_url":null,"source":{"id":"https://openalex.org/S178780388","display_name":"International Journal of Artificial Intelligence Tools","issn_l":"0218-2130","issn":["0218-2130","1793-6349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal on Artificial Intelligence Tools","raw_type":"journal-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/A5112539262","display_name":"Samaneh Hosseini Semnani","orcid":null},"institutions":[{"id":"https://openalex.org/I39268498","display_name":"University of Isfahan","ror":"https://ror.org/05h9t7759","country_code":"IR","type":"education","lineage":["https://openalex.org/I39268498"]}],"countries":["IR"],"is_corresponding":true,"raw_author_name":"SAMANEH HOSSEINI SEMNANI","raw_affiliation_strings":["Engineering Department, University of Isfahan, Isfahan, Iran"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Engineering Department, University of Isfahan, Isfahan, Iran","institution_ids":["https://openalex.org/I39268498"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5069884960","display_name":"Kamran Zamanifar","orcid":"https://orcid.org/0000-0001-5417-0177"},"institutions":[{"id":"https://openalex.org/I39268498","display_name":"University of Isfahan","ror":"https://ror.org/05h9t7759","country_code":"IR","type":"education","lineage":["https://openalex.org/I39268498"]}],"countries":["IR"],"is_corresponding":false,"raw_author_name":"KAMRAN ZAMANIFAR","raw_affiliation_strings":["Engineering Department, University of Isfahan, Isfahan, Iran"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Engineering Department, University of Isfahan, Isfahan, Iran","institution_ids":["https://openalex.org/I39268498"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5112539262"],"corresponding_institution_ids":["https://openalex.org/I39268498"],"apc_list":null,"apc_paid":null,"fwci":0.8235,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.78263878,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"19","issue":"03","first_page":"335","last_page":"346"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9995999932289124,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9995999932289124,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"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.9972000122070312,"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/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.9943000078201294,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"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.8744500279426575},{"id":"https://openalex.org/keywords/ant-colony-optimization-algorithms","display_name":"Ant colony optimization algorithms","score":0.656950831413269},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.6174720525741577},{"id":"https://openalex.org/keywords/queue","display_name":"Queue","score":0.59982830286026},{"id":"https://openalex.org/keywords/fitness-function","display_name":"Fitness function","score":0.5957883596420288},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5010986328125},{"id":"https://openalex.org/keywords/particle-swarm-optimization","display_name":"Particle swarm optimization","score":0.48911529779434204},{"id":"https://openalex.org/keywords/fair-share-scheduling","display_name":"Fair-share scheduling","score":0.42914503812789917},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.3995990753173828},{"id":"https://openalex.org/keywords/genetic-algorithm","display_name":"Genetic algorithm","score":0.34914061427116394},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.3331105709075928},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.25024354457855225},{"id":"https://openalex.org/keywords/quality-of-service","display_name":"Quality of service","score":0.1342926323413849},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.0640135109424591}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8744500279426575},{"id":"https://openalex.org/C40128228","wikidata":"https://www.wikidata.org/wiki/Q460851","display_name":"Ant colony optimization algorithms","level":2,"score":0.656950831413269},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.6174720525741577},{"id":"https://openalex.org/C160403385","wikidata":"https://www.wikidata.org/wiki/Q220543","display_name":"Queue","level":2,"score":0.59982830286026},{"id":"https://openalex.org/C176066374","wikidata":"https://www.wikidata.org/wiki/Q629118","display_name":"Fitness function","level":3,"score":0.5957883596420288},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5010986328125},{"id":"https://openalex.org/C85617194","wikidata":"https://www.wikidata.org/wiki/Q2072794","display_name":"Particle swarm optimization","level":2,"score":0.48911529779434204},{"id":"https://openalex.org/C31689143","wikidata":"https://www.wikidata.org/wiki/Q733809","display_name":"Fair-share scheduling","level":3,"score":0.42914503812789917},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.3995990753173828},{"id":"https://openalex.org/C8880873","wikidata":"https://www.wikidata.org/wiki/Q187787","display_name":"Genetic algorithm","level":2,"score":0.34914061427116394},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.3331105709075928},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.25024354457855225},{"id":"https://openalex.org/C5119721","wikidata":"https://www.wikidata.org/wiki/Q220501","display_name":"Quality of service","level":2,"score":0.1342926323413849},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.0640135109424591},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.0},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1142/s0218213010000212","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0218213010000212","pdf_url":null,"source":{"id":"https://openalex.org/S178780388","display_name":"International Journal of Artificial Intelligence Tools","issn_l":"0218-2130","issn":["0218-2130","1793-6349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal on Artificial Intelligence Tools","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":19,"referenced_works":["https://openalex.org/W125869453","https://openalex.org/W160850993","https://openalex.org/W1557288165","https://openalex.org/W1587738072","https://openalex.org/W1748133846","https://openalex.org/W1855301476","https://openalex.org/W1967042053","https://openalex.org/W2025704344","https://openalex.org/W2054498531","https://openalex.org/W2107941094","https://openalex.org/W2116444923","https://openalex.org/W2148858970","https://openalex.org/W2154929945","https://openalex.org/W2163809172","https://openalex.org/W2535974570","https://openalex.org/W2546148482","https://openalex.org/W3009362096","https://openalex.org/W3152703111","https://openalex.org/W4299796063"],"related_works":["https://openalex.org/W2182624400","https://openalex.org/W2365800168","https://openalex.org/W2767428579","https://openalex.org/W1992807692","https://openalex.org/W2078492738","https://openalex.org/W3014549013","https://openalex.org/W2114356839","https://openalex.org/W3134384462","https://openalex.org/W2125094050","https://openalex.org/W2540137049"],"abstract_inverted_index":{"The":[0,133,205],"problem":[1,99,126],"of":[2,21,62,67,77,100,135,156,210],"finding":[3,101],"the":[4,22,53,63,75,98,125,130,153,164,186,208],"best":[5,131],"quantum":[6],"time":[7,56,78,103],"in":[8,14,26,45,71],"multi-level":[9],"processor":[10,54,83,109,158],"scheduling":[11,18,40],"is":[12,19,74,94,139,149,172],"addressed":[13],"this":[15,36,72,86,112,211],"paper.":[16],"Processor":[17],"one":[20,39],"most":[23,64],"important":[24,65],"issues":[25],"operating":[27],"systems":[28],"design.":[29],"Different":[30],"schedulers":[31],"are":[32,43,183],"introduced":[33],"to":[34,49,57,81,96,105,107,117,128,152,163,177,201],"solve":[35,97,202],"problem.":[37,204],"In":[38,85,111],"approach,":[41],"processes":[42],"placed":[44],"different":[46],"queues":[47],"according":[48,151,162],"their":[50],"properties,":[51],"and":[52,160,185,193],"allocates":[55],"each":[58,82,108,114,136,157],"queue":[59,159,165],"iteratively.":[60],"One":[61],"parameters":[66,155],"a":[68,142,169],"processor's":[69],"efficiency":[70,209],"approach":[73],"amount":[76],"slices":[79,104],"associated":[80],"queue.":[84,110],"paper,":[87],"an":[88,119],"ant":[89,115,176],"colony":[90],"optimization":[91,196],"(ACO)":[92],"algorithm":[93,123,191],"presented":[95,173,184],"appropriate":[102,120],"assign":[106],"technique,":[113],"tries":[116],"find":[118,129],"scheduling.":[121,132],"Ant":[122],"searches":[124],"space":[127],"quality":[134],"ant's":[137],"solution":[138],"evaluated":[140],"using":[141],"new":[143],"fitness":[144,147],"function.":[145],"This":[146],"function":[148,171],"designed":[150],"evaluation":[154],"also":[161],"theory's":[166],"relations.":[167],"Also":[168],"heuristic":[170],"which":[174,199],"prompts":[175],"select":[178],"better":[179],"solutions.":[180],"Computational":[181],"tests":[182],"comparisons":[187],"made":[188],"with":[189],"genetic":[190],"(GA)":[192],"particle":[194],"swarm":[195],"(PSO)":[197],"algorithms":[198],"try":[200],"same":[203],"results":[206],"show":[207],"algorithm.":[212]},"counts_by_year":[{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":1}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}