{"doi":"10.4230/oasics.ppes.2011.42","title":"Unknown","abstract":null,"journal":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","year":null,"id":28614,"datarank":0.1768505522765776,"base_score":0.6931471805599453,"endowment":0.6931471805599453,"self_citation_contribution":0.10397207708399181,"citation_network_contribution":0.07287847519258578,"self_endowment_contribution":0.10397207708399181,"citer_contribution":0.07287847519258578,"corpus_percentile":null,"corpus_rank":null,"citation_count":1,"citer_count":1,"citers_with_citation_signal":1,"citers_with_endowment":1,"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":[],"reference_count":0,"raw_metadata":{"has_enrichment":true,"base_score":0.6931471805599453,"endowment":0.6931471805599453,"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/W1526709096","authors":[],"funders":[],"total_grants":0,"fwci":0.2519,"citation_percentile":0.5178009,"influential_citations":0,"citation_trend":[{"year":2013,"count":1}],"oa_status":"green","license":"cc by-nd 3.0","oa_locations":[{"url":"https://doi.org/10.4230/oasics.ppes.2011.42","host_type":"repository"},{"url":"https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.PPES.2011.42","host_type":"repository"}],"fields_of_study":["Real-Time Systems Scheduling","Embedded Systems Design Techniques","Parallel Computing and Optimization Techniques","Computer Science","Engineering"],"mesh_terms":[],"keywords":["real-time operating system","multi-core","semi-partitioned scheduling","Computer science","Fixed-priority pre-emptive scheduling","Fair-share scheduling","Two-level scheduling","Dynamic priority scheduling","Rate-monotonic scheduling","Round-robin scheduling","Distributed computing","Earliest deadline first scheduling","Scheduling (production processes)","Parallel computing","Lottery scheduling","Gang scheduling","Operating system","Mathematical optimization","Mathematics","Schedule"],"sdg_mappings":[],"linked_datasets":[{"doi":"10.4230/oasics.ppes.2011","title":"OASIcs, Volume 18, PPES'11, Complete Volume","publisher":"Schloss Dagstuhl – Leibniz-Zentrum für Informatik","resource_type":"ConferenceProceeding"}],"clinical_trials":[],"software_tools":[],"database_accessions":[],"source":"live","citation_network_status":"fetched"},"created_at":"2026-06-08T21:47:59.958023Z","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":[]}