Find research datasets worth reusing
Search datasets from major research repositories and use ShareScore to quickly assess how well each record supports discovery, access, and reuse.
7
datasets available to search
ShareScore release 0.9.0
Dataset results
7 results for “scheduling algorithms”
Performance results of different scheduling algorithms used in the simulation of a modern game engine
<p><strong>Performance results of different scheduling algorithms used in the simulation of a modern game engine</strong></p> <p>These results are a companion to the paper entitled "<em>Exploring scheduling algorithms for parallel task graphs: a modern game engine case study</em>" by M. Regragui et al.</p> <p><strong>General information</strong></p> <p>This dataset contains raw outputs and scripts to visualize and analyze the scheduling results from our game engine simulator.<br> The result analysis can be directly reproduced using the script run_analysis.sh. A series of Jupyter Notebook files are also available to help visualize the results.</p> <p><strong>File information</strong></p> <p>- All Scenario*.ipynb files contain python scripts to visualize and analyze the simulation results.<br> - The Scenario*.py files contain python scripts that can be run directly with Jupyter Notebook.<br> - The requirements.txt file contains the names and versions of python packages necessary to reproduce the analysis.<br> - The run_analysis.sh file contains a bash script to install the required python packages and run the Scenario*.py scripts.</p> <p>The results are organized in five folders:</p> <p>1. Result_1 contains the results for Scenario 1 generated using file input_scenario_1.txt.<br> 2. Result_2 contains the results for Scenario 2 generated using file input_scenario_2.txt.<br> 3. Result_3 contains the results for Scenario 3 generated using file input_scenario_3.txt.<br> 4. Result_CP_1 contains the results for the critical path of Scenarios 1 and 2 generated using file input_CP_scenario_1.txt.<br> 5. Result_CP_3 contains the results for the critical path of Scenario 3 generated using file input_CP_scenario_3.txt.</p> <p>Each result file (e.g., HLF_NonSorted_Random_1_200_10.txt) contains 200 lines representing information of the 200 frames that were simulated. Each line contains four values: the frame number, the duration of the frame (in microseconds), a critical path estimation for the previous frame (in microseconds), and the load parameter (value between 0 and 1).</p> <p>The outputs of this analysis include some PDF files representing the figures in the paper (in order) and some CSV files representing the values shown in tables. The standard output shows the p-values computed in parts of the statistical analysis.</p> <p><strong>Software and hardware information</strong></p> <p>The simulation results were generated on an Intel Core i7-1185G7 processor, with 32 GB of LPDDR4 RAM (3200 MHz). The machine ran on Ubuntu 20.04.3 LTS (5.14.0-1034-oem), and g++ 9.4.0 was used for the simulator's compilation (-O3 flag).</p> <p>The results were analyzed using Python 3.8.10, pip 20.0.2 and jupyter-notebook 6.0.3. The following packages and their respective versions were used:</p> <p>- pandas 1.3.2<br> - numpy 1.21.2<br> - matplotlib 3.4.3<br> - seaborn 0.11.2<br> - scipy 1.7.1<br> - pytz 2019.3<br> - python-dateutil 2.7.3<br> - kiwisolver 1.3.2 <br> - pyparsing 2.4.7 <br> - cycler 0.10.0 <br> - Pillow 7.0.0<br> - six 1.14.0 </p> <p><strong>Simulation information</strong></p> <p>Simulation results were generated from 4 to 20 resources. Each configuration was run with 50 different RNG seeds (1 up to 50).</p> <p>Each simulation is composed of 200 frames. The load parameter (lag) starts at zero and increases by 0.01 with each frame up to a value equal to 100% in frame 101. After that, the load parameter starts to decrease in the same rhythm down to 0.01 in frame 200.</p> <p><strong>Algorithms abbreviation in presentation order</strong></p> <p>FIFO serves as the baseline for comparisons.</p> <p>1. FIFO: First In First Out.<br> 2. LPT: Longest Processing Time First.<br> 3. SPT: Shortest Processing Time First.<br> 4. SLPT: LPT at a subtask level.<br> 5. SSPT: SPT at a subtask level.<br> 6. HRRN: Highest Response Ratio Next. <br> 7. WT: Longest Waiting Time First.<br> 8. HLF: Hu's Level First with unitary processing time of each task.<br> 9. HLFET: HLF with estimated times.<br> 10. CG: Coffman-Graham's Algorithm.<br> 11. DCP: Dynamic Critical Path Priority.</p> <p><strong>Metrics</strong></p> <p>* SF: slowest frame (maximum frame execution time)<br> * DF: number of delayed frames (with 16.667 ms as the due date)<br> * CS: cumulative slowdown (with 16.667 ms as the due date)<br> </p>
Data, scripts, and plots for the paper "A Comparative Study of OpenMP Scheduling Algorithm Selection Strategies"
<p>Data, scripts, and plots for the paper "A Comparative Study of OpenMP Scheduling Algorithm Selection Strategies"</p>
Parameterized Task Graph Scheduling Algorithm for Comparing Algorithmic Components - All Figures and Datasets
<p>Figures and Datasets for "Parameterized Task Graph Scheduling Algorithm for Comparing Algorithmic Components"</p> <ul> <li>dataset.zip: All datasets evaluated</li> <li>figures.zip: All plots (1080) for all results for our paper</li> </ul>
Packing-Inspired Algorithms for Periodic Scheduling Problems with Harmonic Periods - instances
<p>Instances for periodic scheduling problem used in conference paper <a title="Paper Details, Citation and Download" href="https://www.scitepress.org/PublicationsDetail.aspx?ID=nP/EuJcR7dI=&t=1">Packing-Inspired Algorithms for Periodic Scheduling Problems with Harmonic Periods</a> <span></span> <a href="https://doi.org/10.5220/0012325800003639" target="_blank" rel="noopener">10.5220/0012325800003639</a></p> <p> </p>
Data, scripts, and plots for the paper ICCP "Learning to Select Scheduling Algorithm in OpenMP"
Open the record for dataset details and reuse information.
STUDY TO DETERMINE THE EFFICACY AND SAFETY OF STANDARD SCHEDULE VERSUS A NEW ALGORITHM OF DOSE REDUCTIONS IN ELDERLY AND UNFIT NEWLY DIAGNOSED MULTIPLE MYELOMA PATIENTS RECEIVING LENALIDOMIDE PLUS STE
ClinicalTrials.gov study NCT02215980. IPD Sharing: Not stated. Countries: 1. Publications: 1.
Development of a Predictive Algorithm for a Hemoglobin Value of Less Than 10 g/dl Postoperatively in Scheduled Hip or Knee Arthroplasty
ClinicalTrials.gov study NCT05605860. IPD Sharing: Not stated. Countries: 1. Publications: 6.
ScienceDex guides
Understand access before you commit
These curated guides explain access requirements, typical timelines, costs, and reuse considerations for widely used research datasets.
Allen Brain Atlas
Allen Brain Atlas is an Allen Institute collection of brain map atlases, datasets, APIs, and analysis tools covering mouse, human, and non-human primate brain resources.
Annotated Behaviour and Observability Dataset (ABODe)
ABODe is a University of Edinburgh DataShare dataset for behavior classification in group-housed mice using home-cage video, identities, bounding boxes, ground-plate positions, and annotator labels.
DANDI Archive for NWB datasets
DANDI is a BRAIN Initiative archive for publishing and sharing neurophysiology data, including electrophysiology, optophysiology, and behavioral data packaged as NWB and related standards.
International Brain Laboratory public data
The International Brain Laboratory public data releases expose standardized mouse decision-making experiments, including Neuropixels recordings, widefield calcium imaging, behavior, and session metadata accessed through the ONE API.
OpenNeuro
OpenNeuro is a free, open platform for sharing neuroimaging datasets, with public search, dataset pages, and download paths for web, S3, DataLad, and the OpenNeuro CLI.