{"doi":"10.1109/isorc.2015.23","title":"Dynamic Partitioning Based Scheduling of Real-Time Tasks in Multicore Processors","abstract":null,"journal":"2015 IEEE 18th International Symposium on Real-Time Distributed Computing","year":2015,"id":27314,"datarank":1.0062403359413927,"base_score":2.5649493574615367,"endowment":2.5649493574615367,"self_citation_contribution":0.38474240361923057,"citation_network_contribution":0.6214979323221621,"self_endowment_contribution":0.38474240361923057,"citer_contribution":0.6214979323221621,"corpus_percentile":null,"corpus_rank":null,"citation_count":12,"citer_count":12,"citers_with_citation_signal":9,"citers_with_endowment":9,"datacite_reuse_total":1,"is_dataset":false,"is_dataset_confidence":null,"is_data_producer":false,"deposit_databanks":null,"is_oa":false,"file_count":0,"downloads":0,"has_version_chain":false,"published_date":null,"fair_score":null,"fair_percentile":null,"algorithm_id":"datarank_citation_only_1hop_v6","ranking_scope":"data_only","authors":[{"id":156000,"name":"R.C. Hansdah","orcid":null,"position":1,"is_corresponding":false},{"id":155999,"name":"N. Saranya","orcid":null,"position":0,"is_corresponding":false}],"reference_count":0,"raw_metadata":{"has_enrichment":true,"base_score":2.5649493574615367,"endowment":2.5649493574615367,"datacite_reuse_total":1,"file_count":0,"downloads":0,"views":0,"has_version_chain":false,"is_dataset":false,"is_oa":false,"pmid":"18998881","pmcid":null,"openalex_id":"https://openalex.org/W1545991362","authors":[],"funders":[],"total_grants":0,"fwci":0.6597,"citation_percentile":0.67908185,"influential_citations":1,"citation_trend":[{"year":2018,"count":2},{"year":2019,"count":1},{"year":2020,"count":3},{"year":2021,"count":1},{"year":2022,"count":1},{"year":2023,"count":1},{"year":2024,"count":1},{"year":2025,"count":2}],"oa_status":"closed","license":null,"oa_locations":[{"url":"http://xplorestaging.ieee.org/ielx7/7153316/7153773/07153806.pdf?arnumber=7153806","host_type":"publisher"},{"url":"https://doi.org/10.1109/isorc.2015.23","host_type":""}],"fields_of_study":["Real-Time Systems Scheduling","Parallel Computing and Optimization Techniques","Embedded Systems Design Techniques","Computer Science","Engineering"],"mesh_terms":[],"keywords":["Fixed-priority pre-emptive scheduling","Dynamic priority scheduling","Computer science","Fair-share scheduling","Two-level scheduling","Round-robin scheduling","Rate-monotonic scheduling","Earliest deadline first scheduling","Gang scheduling","Parallel computing","Distributed computing","Scheduling (production processes)","Lottery scheduling","Least slack time scheduling","Deadline-monotonic scheduling","Multi-core processor","Schedule","Operating system","Mathematical optimization","Mathematics"],"sdg_mappings":[{"sdg_number":0,"sdg_label":"Decent work and economic growth"}],"linked_datasets":[{"doi":"10.4230/lipics.ecrts.2024.17","title":"Response Time Analysis for Fixed-Priority Preemptive Uniform Multiprocessor Systems","publisher":"Schloss Dagstuhl – Leibniz-Zentrum für Informatik","resource_type":"ConferencePaper"}],"clinical_trials":[],"software_tools":[],"database_accessions":[],"source":"live","citation_network_status":"fetched"},"created_at":"2026-06-08T17:30:25.253192Z","pmid":null,"pmcid":null,"fwci":null,"citation_percentile":null,"influential_citations":0,"oa_status":null,"license":null,"views":0,"total_file_size_bytes":0,"version_count":0,"fair_f":null,"fair_a":null,"fair_i":null,"fair_r":null,"fair_zscore":null,"fair_rationale":null,"fair_model":null,"fair_agent_version":null,"fair_fulltext_source":null,"fair_has_llm":null,"fair_computed_at":null,"clinical_trials":[],"software_tools":[],"db_accessions":[],"linked_datasets":[],"topics":[]}