On the public citation graph
Toward convergence in job schedulers for parallel supercomputers
0 signed · 213 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1006/jpdc.1995.1014openalex-snapshot
Evaluating the Performance of Cache-Affinity Scheduling in Shared-Memory Multiprocessors
inferredcites →https://doi.org/10.1006/jpdc.1996.0064openalex-snapshot
Evaluation of Design Choices for Gang Scheduling Using Distributed Hierarchical Control
inferredcites →https://doi.org/10.1007/3-540-60153-8_20openalex-snapshot
Parallel job scheduling: Issues and approaches
inferredcites →https://doi.org/10.1007/3-540-60153-8_22openalex-snapshot
A scalable multi-discipline, multiple-processor scheduling framework for IRIX
inferredcites →https://doi.org/10.1007/3-540-60153-8_24openalex-snapshot
Time Space Sharing Scheduling and architectural support
inferredcites →https://doi.org/10.1007/3-540-60153-8_26openalex-snapshot
Multiprocessor scheduling for high-variability service time distributions
inferredcites →https://doi.org/10.1007/3-540-60153-8_28openalex-snapshot
Analysis of non-work-conserving processor partitioning policies
inferredcites →https://doi.org/10.1007/3-540-60153-8_33openalex-snapshot
Parallel processing on dynamic resources with CARMI
inferredcites →https://doi.org/10.1007/3-540-60153-8_34openalex-snapshot
Job scheduling under the Portable Batch System
inferredcites →https://doi.org/10.1007/3-540-60153-8_35openalex-snapshot
The ANL/IBM SP scheduling system
inferredcites →https://doi.org/10.1007/3-540-60153-8_38openalex-snapshot
Job characteristics of a production parallel scientific workload on the NASA Ames iPSC/860
inferredcites →https://doi.org/10.1007/bfb0022285openalex-snapshot
Workload evolution on the Cornell Theory Center IBM SP2
inferredcites →https://doi.org/10.1007/bfb0022286openalex-snapshot
The EASY — LoadLeveler API project
inferredcites →https://doi.org/10.1007/bfb0022287openalex-snapshot
A batch scheduler for the Intel Paragon with a non-contiguous node allocation algorithm
inferredcites →https://doi.org/10.1007/bfb0022288openalex-snapshot
Architecture-independent request-scheduling with tight waiting-time estimations
inferredcites →https://doi.org/10.1007/bfb0022289openalex-snapshot
Packing schemes for gang scheduling
inferredcites →https://doi.org/10.1007/bfb0022290openalex-snapshot
A gang scheduling design for multiprogrammed parallel computing environments
inferredcites →https://doi.org/10.1007/bfb0022291openalex-snapshot
Implementation of gang-scheduling on workstation cluster
inferredcites →https://doi.org/10.1007/bfb0022292openalex-snapshot
Managing checkpoints for parallel programs
inferredcites →https://doi.org/10.1007/bfb0022293openalex-snapshot
Using runtime measured workload characteristics in parallel processor scheduling
inferredcites →https://doi.org/10.1007/bfb0022294openalex-snapshot
Parallel application characterization for multiprocessor scheduling policy design
inferredcites →https://doi.org/10.1007/bfb0022295openalex-snapshot
Dynamic vs. static quantum-based parallel processor allocation
inferredcites →https://doi.org/10.1007/bfb0022296openalex-snapshot
Dynamic versus adaptive processor allocation policies for message passing parallel computers: An empirical comparison
inferredcites →https://doi.org/10.1007/bfb0022297openalex-snapshot
Dynamic partitioning in different distributed-memory environments
inferredcites →https://doi.org/10.1016/0166-5316(94)90036-1openalex-snapshot
Application scheduling and processor allocation in multiprogrammed parallel processing systems
inferredcites →https://doi.org/10.1016/0166-5316(94)90037-xopenalex-snapshot
Robust partitioning policies of multiprocessor systems
inferredcites →https://doi.org/10.1016/0743-7315(92)90014-eopenalex-snapshot
Gang scheduling performance benefits for fine-grain synchronization
inferredcites →https://doi.org/10.1109/12.57056openalex-snapshot
Subcube allocation and task migration in hypercube multiprocessors
inferredcites →https://doi.org/10.1109/2.214439openalex-snapshot
Heterogeneous computing: challenges and opportunities
inferredcites →https://doi.org/10.1109/2.53356openalex-snapshot
Distributed hierarchical control for parallel processing
inferredcites →https://doi.org/10.1109/71.207589openalex-snapshot
Using processor-cache affinity information in shared-memory multiprocessor scheduling
inferredcites →https://doi.org/10.1109/71.282559openalex-snapshot
Job scheduling is more important than processor allocation for hypercube computers
inferredcites →https://doi.org/10.1109/spdp.1991.218246openalex-snapshot
Multiprogramming on multiprocessors
inferredcites →https://doi.org/10.1109/spdp.1993.395466openalex-snapshot
A fast and efficient strategy for submesh allocation in mesh-connected parallel computers
inferredcites →https://doi.org/10.1145/107971.107985openalex-snapshot
The impact of operating system scheduling policies and synchronization methods of performance of parallel applications
inferredcites →https://doi.org/10.1145/151244.151246openalex-snapshot
A dynamic processor allocation policy for multiprogrammed shared-memory multiprocessors
inferredcites →https://doi.org/10.1145/183018.183022openalex-snapshot
Processor allocation policies for message-passing parallel computers
inferredcites →https://doi.org/10.1145/327070.327143openalex-snapshot
Issues related to MIMD shared-memory computers
inferredcites →https://doi.org/10.1145/602770.602811openalex-snapshot
Non-contiguous processor allocation algorithms for distributed memory multicomputers
inferredcites →https://doi.org/10.1145/74850.74866openalex-snapshot
Process control and scheduling issues for multiprogrammed shared-memory multiprocessors
inferredcites →https://doi.org/10.1145/74851.74866openalex-snapshot
Process control and scheduling issues for multiprogrammed shared-memory multiprocessors
inferredcites →https://doi.org/10.1145/75108.75391openalex-snapshot
Characterizations of parallelism in applications and their use in scheduling
inferredcites →https://doi.org/10.1145/98457.98760openalex-snapshot
Processor scheduling in shared memory multiprocessors
inferredcites →https://doi.org/10.5555/602770.602811openalex-snapshot
Non-contiguous processor allocation algorithms for distributed memory multicomputers
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/cpe.1362openalex-snapshot
Malleable iterative MPI applications
inferred← citeshttps://doi.org/10.1002/cpe.5761openalex-snapshot
Static job scheduling for environments with vertical elasticity
inferred← citeshttps://doi.org/10.1007/10968987_1openalex-snapshot
Scheduling in HPC Resource Management Systems: Queuing vs. Planning
inferred← citeshttps://doi.org/10.1007/10968987_12openalex-snapshot
Backfilling with Lookahead to Optimize the Performance of Parallel Job Scheduling
inferred← citeshttps://doi.org/10.1007/11605300_13openalex-snapshot
Pitfalls in Parallel Job Scheduling Evaluation
inferred← citeshttps://doi.org/10.1007/11605300_2openalex-snapshot
Workload Analysis of a Cluster in a Grid Environment
inferred← citeshttps://doi.org/10.1007/11846802_41openalex-snapshot
Observations on MPI-2 Support for Hybrid Master/Slave Applications in Dynamic and Heterogeneous Environments
inferred← citeshttps://doi.org/10.1007/11847366_77openalex-snapshot
Towards SLA-Supported Resource Management
inferred← citeshttps://doi.org/10.1007/3-540-39997-6_1openalex-snapshot
Effect of Job Size Characteristics on Job Scheduling Performance
inferred← citeshttps://doi.org/10.1007/3-540-39997-6_10openalex-snapshot
The Influence of the Structure and Sizes of Jobs on the Performance of Co-allocation
inferred← citeshttps://doi.org/10.1007/3-540-39997-6_8openalex-snapshot
Time-Sharing Parallel Jobs in the Presence of Multiple Resource Requirements
inferred← citeshttps://doi.org/10.1007/3-540-44839-x_98openalex-snapshot
Resource Management for Finite Element Codes on Shared Memory Systems
inferred← citeshttps://doi.org/10.1007/3-540-45540-x_5openalex-snapshot
The Influence of Communication on the Performance of Co-allocation
inferred← citeshttps://doi.org/10.1007/3-540-47954-6_4openalex-snapshot
Benchmarks and Standards for the Evaluation of Parallel Job Schedulers
inferred← citeshttps://doi.org/10.1007/3-540-63574-2_14openalex-snapshot
Theory and practice in parallel job scheduling
inferred← citeshttps://doi.org/10.1007/3-540-63574-2_15openalex-snapshot
Using queue time predictions for processor allocation
inferred← citeshttps://doi.org/10.1007/3-540-63574-2_17openalex-snapshot
Memory usage in the LANL CM-5 workload
inferred← citeshttps://doi.org/10.1007/978-3-030-27562-4_9openalex-snapshot
Scalable Optimal Greedy Scheduler for Asymmetric Multi-/Many-Core Processors
inferred← citeshttps://doi.org/10.1007/978-3-030-80223-3_35openalex-snapshot
Scalable SAT Solving in the Cloud
inferred← citeshttps://doi.org/10.1007/978-3-030-88224-2_7openalex-snapshot
A HPC Co-scheduler with Reinforcement Learning
inferred← citeshttps://doi.org/10.1007/978-3-030-88224-2_8openalex-snapshot
Performance-Cost Optimization of Moldable Scientific Workflows
inferred← citeshttps://doi.org/10.1007/978-3-030-91702-9_6openalex-snapshot
On the Impact of MDP Design for Reinforcement Learning Agents in Resource Management
inferred← citeshttps://doi.org/10.1007/978-3-031-22698-4_8openalex-snapshot
Optimization of Execution Parameters of Moldable Ultrasound Workflows Under Incomplete Performance Data
inferred← citeshttps://doi.org/10.1007/978-3-031-22698-4_9openalex-snapshot
Scheduling of Elastic Message Passing Applications on HPC Systems
inferred← citeshttps://doi.org/10.1007/978-3-031-23220-6_14openalex-snapshot
On the Convergence of Malleability and the HPC PowerStack: Exploiting Dynamism in Over-Provisioned and Power-Constrained HPC Systems
inferred← citeshttps://doi.org/10.1007/978-3-031-48803-0_14openalex-snapshot
Enhancing Supercomputer Performance with Malleable Job Scheduling Strategies
inferred← citeshttps://doi.org/10.1007/978-3-031-48803-0_8openalex-snapshot
Malleable APGAS Programs and Their Support in Batch Job Schedulers
inferred← citeshttps://doi.org/10.1007/978-3-031-61763-8_15openalex-snapshot
Evolving APGAS Programs: Automatic and Transparent Resource Adjustments at Runtime
inferred← citeshttps://doi.org/10.1007/978-3-031-78459-0_22openalex-snapshot
A Versatile Simulator for Complex Cluster Workloads
inferred← citeshttps://doi.org/10.1007/978-3-031-90200-0_25openalex-snapshot
The Impact of Evolving APGAS Programs on HPC Clusters
inferred← citeshttps://doi.org/10.1007/978-3-032-24923-4_1openalex-snapshot
Evaluating Malleable Job Scheduling in HPC Clusters Using Real-World Workloads
inferred← citeshttps://doi.org/10.1007/978-3-319-61455-7_3openalex-snapshot
Power-Efficient Video System Design
inferred← citeshttps://doi.org/10.1007/978-3-540-24669-5_18openalex-snapshot
Online Scheduling of Multiprocessor Jobs with Idle Regulation
inferred← citeshttps://doi.org/10.1007/978-3-540-24685-5_4openalex-snapshot
Dynamic Parallel Job Scheduling in Multi-cluster Computing Systems
inferred← citeshttps://doi.org/10.1007/978-3-540-78699-3_2openalex-snapshot
Group-Wise Performance Evaluation of Processor Co-allocation in Multi-cluster Systems
inferred← citeshttps://doi.org/10.1007/978-3-540-78699-3_5openalex-snapshot
QBETS: Queue Bounds Estimation from Time Series
inferred← citeshttps://doi.org/10.1007/978-3-540-79409-7_14openalex-snapshot
An Adaptive Space-Sharing Scheduling Algorithm for PC-Based Clusters
inferred← citeshttps://doi.org/10.1007/978-3-540-85451-7_27openalex-snapshot
Co-allocation with Communication Considerations in Multi-cluster Systems
inferred← citeshttps://doi.org/10.1007/978-3-642-10841-9_43openalex-snapshot
Strong Nash Equilibria in Games with the Lexicographical Improvement Property
inferred← citeshttps://doi.org/10.1007/978-3-642-11322-2_26openalex-snapshot
Supporting Malleability in Parallel Architectures with Dynamic CPUSETsMapping and Dynamic MPI
inferred← citeshttps://doi.org/10.1007/978-3-642-32820-6_20openalex-snapshot
A Job Scheduling Approach for Multi-core Clusters Based on Virtual Malleability
inferred← citeshttps://doi.org/10.1007/978-981-10-8639-7_59openalex-snapshot
A Combinational Approach for Optimal Packing of Parallel Jobs in HPC Clusters
inferred← citeshttps://doi.org/10.1007/978-981-15-0372-6_31openalex-snapshot
Implications of Job Loading and Scheduling Structures on Machine Memory Effectiveness
inferred← citeshttps://doi.org/10.1007/bfb0022288openalex-snapshot
Architecture-independent request-scheduling with tight waiting-time estimations
inferred← citeshttps://doi.org/10.1007/bfb0053978openalex-snapshot
Metrics and benchmarking for parallel job scheduling
inferred← citeshttps://doi.org/10.1007/bfb0053983openalex-snapshot
Job scheduling scheme for pure space sharing among rigid jobs
inferred← citeshttps://doi.org/10.1007/bfb0053987openalex-snapshot
Improving first-come-first-serve job scheduling by gang scheduling
inferred← citeshttps://doi.org/10.1007/s00182-012-0322-1openalex-snapshot
Strong equilibria in games with the lexicographical improvement property
inferred← citeshttps://doi.org/10.1007/s10586-022-03692-2openalex-snapshot
Adaptive parallel applications: from shared memory architectures to fog computing (2002–2022)
inferred← citeshttps://doi.org/10.1007/s11227-013-0971-2openalex-snapshot
Improving CompactMatrix phase in gang scheduling by changing transference condition and utilizing exchange
inferred← citeshttps://doi.org/10.1007/s11227-014-1142-9openalex-snapshot
Scheduling parallel jobs on multicore clusters using CPU oversubscription
inferred← citeshttps://doi.org/10.1007/s11227-020-03197-yopenalex-snapshot
Equilibrium: an elasticity controller for parallel tree search in the cloud
inferred← citeshttps://doi.org/10.1007/s11227-023-05882-0openalex-snapshot
Performance-driven scheduling for malleable workloads
inferred← citeshttps://doi.org/10.1007/s42979-024-02641-7openalex-snapshot
On the Performance of Malleable APGAS Programs and Batch Job Schedulers
inferred← citeshttps://doi.org/10.1016/b978-0-12-805467-3.00016-8openalex-snapshot
The HARNESS Platform: A Hardware- and Network-Enhanced Software System for Cloud Computing
inferred← citeshttps://doi.org/10.1016/j.dam.2008.03.005openalex-snapshot
Idle regulation in non-clairvoyant scheduling of parallel jobs
inferred← citeshttps://doi.org/10.1016/j.future.2004.02.001openalex-snapshot
Performance of adaptive space-sharing policies in dedicated heterogeneous cluster systems
inferred← citeshttps://doi.org/10.1016/j.future.2008.09.002openalex-snapshot
Towards a general model of the multi-criteria workflow scheduling on the grid
inferred← citeshttps://doi.org/10.1016/j.future.2009.01.002openalex-snapshot
A progressive multi-layer resource reconfiguration framework for time-shared grid systems
inferred← citeshttps://doi.org/10.1016/j.future.2017.02.005openalex-snapshot
Spatio-temporal thermal-aware scheduling for homogeneous high-performance computing datacenters
inferred← citeshttps://doi.org/10.1016/j.jpdc.2015.09.007openalex-snapshot
Combining performance and priority for scheduling resizable parallel applications
inferred← citeshttps://doi.org/10.1016/j.parco.2015.04.003openalex-snapshot
Enhancing the performance of malleable MPI applications by using performance-aware dynamic reconfiguration
inferred← citeshttps://doi.org/10.1016/j.procs.2011.04.033openalex-snapshot
Toward Malleable Model Coupling
inferred← citeshttps://doi.org/10.1016/s0304-3975(00)00260-7openalex-snapshot
On-line scheduling of parallel jobs with runtime restrictions
inferred← citeshttps://doi.org/10.1016/s0743-7315(03)00108-4openalex-snapshot
The workload on parallel supercomputers: modeling the characteristics of rigid jobs
inferred← citeshttps://doi.org/10.1080/01495730108935269openalex-snapshot
IMPROVED RESOURCE UTILIZATION WITH BUFFERED COSCHEDULING
inferred← citeshttps://doi.org/10.1109/12.811109openalex-snapshot
Performance of hierarchical processor scheduling in shared-memory multiprocessor systems
inferred← citeshttps://doi.org/10.1109/ccgrid.2002.1017131openalex-snapshot
A Malleable-Job System for Timeshared Parallel Machines
inferred← citeshttps://doi.org/10.1109/ccgrid.2003.1199381openalex-snapshot
The performance of processor co-allocation in multicluster systems
inferred← citeshttps://doi.org/10.1109/ccgrid.2007.45openalex-snapshot
Dynamic Malleability in Iterative MPI Applications
inferred← citeshttps://doi.org/10.1109/ccgrid.2012.20openalex-snapshot
Malleable Model Coupling with Prediction
inferred← citeshttps://doi.org/10.1109/ccgrid.2013.72openalex-snapshot
Automatic Performance Prediction for Load-Balancing Coupled Models
inferred← citeshttps://doi.org/10.1109/ccgrid.2018.00031openalex-snapshot
Efficient Fault Tolerance Through Dynamic Node Replacement
inferred← citeshttps://doi.org/10.1109/ccgrid.2019.00054openalex-snapshot
Hybrid Resource Management for HPC and Data Intensive Workloads
inferred← citeshttps://doi.org/10.1109/cluster.2011.56openalex-snapshot
An RMS for Non-predictably Evolving Applications
inferred← citeshttps://doi.org/10.1109/cluster.2014.6968735openalex-snapshot
Evaluating job packing in warehouse-scale computing
inferred← citeshttps://doi.org/10.1109/cluster.2017.27openalex-snapshot
A Malleable and Fault-Tolerant Task Pool Framework for X10
inferred← citeshttps://doi.org/10.1109/cluster49012.2020.00018openalex-snapshot
Resilient Scheduling of Moldable Jobs on Failure-Prone Platforms
inferred← citeshttps://doi.org/10.1109/clustr.2007.4629245openalex-snapshot
Reliability-aware resource allocation in HPC systems
inferred← citeshttps://doi.org/10.1109/clustr.2007.4629252openalex-snapshot
Scheduling malleable applications in multicluster systems
inferred← citeshttps://doi.org/10.1109/hipc.2014.7116905openalex-snapshot
Towards realizing the potential of malleable jobs
inferred← citeshttps://doi.org/10.1109/hipc50609.2020.00036openalex-snapshot
Extending SLURM for Dynamic Resource-Aware Adaptive Batch Scheduling
inferred← citeshttps://doi.org/10.1109/hpcc.2011.36openalex-snapshot
An RMS Architecture for Efficiently Supporting Complex-Moldable Applications
inferred← citeshttps://doi.org/10.1109/hpcc/smartcity/dss.2018.00115openalex-snapshot
A Malleable Vectorized Auction Algorithm for Modern Multicore Architectures
inferred← citeshttps://doi.org/10.1109/hpdc.2002.1029944openalex-snapshot
The performance of processor co-allocation in multicluster systems
inferred← citeshttps://doi.org/10.1109/icad65464.2025.11114059openalex-snapshot
Energy Forecasting in High Performance Computing Datacenters Using Machine Learning
inferred← citeshttps://doi.org/10.1109/icdcs.2000.840933openalex-snapshot
Scheduling with global information in distributed systems
inferred← citeshttps://doi.org/10.1109/icpads.2015.81openalex-snapshot
FRAME: Fair Resource Allocation in Multi-process Environments
inferred← citeshttps://doi.org/10.1109/icpp.2008.27openalex-snapshot
An Incentive-Compatible Mechanism for Scheduling Non-Malleable Parallel Jobs with Individual Deadlines
inferred← citeshttps://doi.org/10.1109/icpp.2010.60openalex-snapshot
Incentive Compatible Online Scheduling of Malleable Parallel Jobs with Individual Deadlines
inferred← citeshttps://doi.org/10.1109/icpp.2013.20openalex-snapshot
A Dynamic Moldable Job Scheduling Based Parallel SAT Solver
inferred← citeshttps://doi.org/10.1109/icpp.2014.44openalex-snapshot
A Batch System with Fair Scheduling for Evolving Applications
inferred← citeshttps://doi.org/10.1109/icppw.2014.15openalex-snapshot
Flux: A Next-Generation Resource Management Framework for Large HPC Centers
inferred← citeshttps://doi.org/10.1109/icppw.2017.36openalex-snapshot
Efficient Scalable Computing through Flexible Applications and Adaptive Workloads
inferred← citeshttps://doi.org/10.1109/iiswc.2006.302746openalex-snapshot
Predicting Bounds on Queuing Delay in Space-shared Computing Environments
inferred← citeshttps://doi.org/10.1109/ipdps.2015.34openalex-snapshot
A Batch System with Efficient Adaptive Scheduling for Malleable and Evolving Applications
inferred← citeshttps://doi.org/10.1109/ipdps53621.2022.00052openalex-snapshot
Hybrid Workload Scheduling on HPC Systems
inferred← citeshttps://doi.org/10.1109/ipdps54959.2023.00094openalex-snapshot
rFaaS: Enabling High Performance Serverless with RDMA and Leases
inferred← citeshttps://doi.org/10.1109/ipdps57955.2024.00021openalex-snapshot
Software Resource Disaggregation for HPC with Serverless Computing
inferred← citeshttps://doi.org/10.1109/ispa.2008.122openalex-snapshot
EasyGrid Enabling of Iterative Tightly-Coupled Parallel MPI Applications
inferred← citeshttps://doi.org/10.1109/ispa.2012.28openalex-snapshot
Dynamic Load Balancing for Malleable Model Coupling
inferred← citeshttps://doi.org/10.1109/iwqos.2016.7590423openalex-snapshot
Multi-Resource Partial-Ordered Task Scheduling in cloud computing
inferred← citeshttps://doi.org/10.1109/mucocos.2013.6633602openalex-snapshot
Topology-aware equipartitioning with coscheduling on multicore systems
inferred← citeshttps://doi.org/10.1109/padsw.2018.8644536openalex-snapshot
Effectiveness of Moldable and Malleable Scheduling in Deep Learning Tasks
inferred← citeshttps://doi.org/10.1109/sbac-pad.2013.4openalex-snapshot
Autonomic Malleability in Iterative MPI Applications
inferred← citeshttps://doi.org/10.1109/sbac-pad.2019.00032openalex-snapshot
Phase-Based Tasks Scheduling in Data Centers Powered Exclusively by Renewable Energy
inferred← citeshttps://doi.org/10.1109/sc.2014.71openalex-snapshot
Maximizing Throughput of Overprovisioned HPC Data Centers Under a Strict Power Budget
inferred← citeshttps://doi.org/10.1109/synasc.2013.74openalex-snapshot
Evaluating Moldability of LHCb Jobs for Multicore Job Submission
inferred← citeshttps://doi.org/10.1109/tc.2020.3022933openalex-snapshot
DMRlib: Easy-Coding and Efficient Resource Management for Job Malleability
inferred← citeshttps://doi.org/10.1109/tc.2021.3104747openalex-snapshot
Resilient Scheduling of Moldable Parallel Jobs to Cope With Silent Errors
inferred← citeshttps://doi.org/10.1109/tpds.2016.2537821openalex-snapshot
A Taxonomy of Job Scheduling on Distributed Computing Systems
inferred← citeshttps://doi.org/10.1109/tpds.2026.3727706openalex-snapshot
Coping With Silent Errors for Workflows of Moldable Tasks
inferred← citeshttps://doi.org/10.1109/waina.2008.110openalex-snapshot
Model-Driven Automation in Grid Environments
inferred← citeshttps://doi.org/10.1142/s0129626407002855openalex-snapshot
Using Model-based Clustering to Improve Predictions for Queueing Delay on Parallel Machines
inferred← citeshttps://doi.org/10.1142/s0129626426500167openalex-snapshot
Fault-tolerance Strategies for Linear Chains of Moldable Tasks
inferred← citeshttps://doi.org/10.1145/1122971.1122989openalex-snapshot
Predicting bounds on queuing delay for batch-scheduled parallel machines
inferred← citeshttps://doi.org/10.1145/1272366.1272381openalex-snapshot
Precise and realistic utility functions for user-centric performance analysis of schedulers
inferred← citeshttps://doi.org/10.1145/2463209.2488942openalex-snapshot
Distributed run-time resource management for malleable applications on many-core platforms
inferred← citeshttps://doi.org/10.1145/2523616.2525936openalex-snapshot
Introducing service-level awareness in the cloud
inferred← citeshttps://doi.org/10.1145/2749246.2749262openalex-snapshot
Practical Resource Management in Power-Constrained, High Performance Computing
inferred← citeshttps://doi.org/10.1145/309746.309753openalex-snapshot
Experiences with parallel job scheduling on a transputer system
inferred← citeshttps://doi.org/10.1145/3182173openalex-snapshot
A Hierarchical Distributed Runtime Resource Management Scheme for NoC-Based Many-Cores
inferred← citeshttps://doi.org/10.1145/3183767.3183790openalex-snapshot
Implicit Data-Parallelism in Kahn Process Networks
inferred← citeshttps://doi.org/10.1145/3548607openalex-snapshot
Checkpointing Workflows à la Young/Daly Is Not Good Enough
inferred← citeshttps://doi.org/10.1145/3584684openalex-snapshot
Proceedings of the 5th workshop on Advanced tools, programming languages, and PLatforms for Implementing and Evaluating algorithms for Distributed systems
inferred← citeshttps://doi.org/10.1145/3584684.3597264openalex-snapshot
Invited Paper: ServerFilling: A better approach to packing multiserver jobs
inferred← citeshttps://doi.org/10.1145/3629104.3666038openalex-snapshot
Job Scheduling for HPC Clusters: Constraint Programming vs. Backfilling Approaches
inferred← citeshttps://doi.org/10.1145/3630052openalex-snapshot
Improved Online Scheduling of Moldable Task Graphs under Common Speedup Models
inferred← citeshttps://doi.org/10.1145/3726301.3728412openalex-snapshot
Autonomic Partition-Aware Malleable Microscopic Traffic Simulation
inferred← citeshttps://doi.org/10.1145/377792.377852openalex-snapshot
Improving Gang Scheduling through job performance analysis and malleability
inferred← citeshttps://doi.org/10.1155/2011/925395openalex-snapshot
GSSIM – A Tool for Distributed Computing Experiments
inferred← citeshttps://doi.org/10.1155/2014/423084openalex-snapshot
TACO: A Scheduling Scheme for Parallel Applications on Multicore Architectures
inferred← citeshttps://doi.org/10.11606/t.55.2012.tde-10102012-103142openalex-snapshot
Contribuições na área de Sistemas Distribuídos e Redes de Computadores e suas aplicações em Sistemas Embarcados Críticos
inferred← citeshttps://doi.org/10.11606/t.55.2018.tde-05012018-103739openalex-snapshot
Uma abordagem para a avaliação do escalonamento de processos em sistemas distribuídos baseada em monitoração
inferred← citeshttps://doi.org/10.14279/depositonce-6793openalex-snapshot
TACO: A Scheduling Scheme for Parallel Applications on Multicore Architectures
inferred← citeshttps://doi.org/10.1587/transinf.2018edp7038openalex-snapshot
Improving Per-Node Computing Efficiency by an Adaptive Lock-Free Scheduling Model
inferred← citeshttps://doi.org/10.17877/de290r-5213openalex-snapshot
Design and evaluation of job scheduling strategies for grid computing
inferred← citeshttps://doi.org/10.23919/isc.2025.11018304openalex-snapshot
Bridging the Gap Between Genericity and Programmability of Dynamic Resources in HPC
inferred← citeshttps://doi.org/10.26240/heal.ntua.13369openalex-snapshot
Design and implementation of a run-time resource manager for malleable applications on network-on-chip (NoC) architecture
inferred← citeshttps://doi.org/10.3390/app12105231openalex-snapshot
A Survey on Malleability Solutions for High-Performance Distributed Computing
inferred← citeshttps://doi.org/10.3390/electronics15010116openalex-snapshot
A High-Performance Computing Cluster Intelligent Scheduling Algorithm Based on Graph Neural Network and Actor–Critic
inferred← citeshttps://doi.org/10.3837/tiis.2019.09.002openalex-snapshot
Resource management for moldable parallel tasks supporting slot time in the Cloud
inferred← citeshttps://doi.org/10.48550/arxiv.1006.2617openalex-snapshot
Gang FTP scheduling of periodic and parallel rigid real-time tasks
inferred← citeshttps://doi.org/10.48550/arxiv.2010.00631openalex-snapshot
Stability for Two-class Multiserver-job Systems
inferred← citeshttps://doi.org/10.48550/arxiv.2103.05809openalex-snapshot
A Resourceful Coordination Approach for Multilevel Scheduling
inferred← citeshttps://doi.org/10.48550/arxiv.2109.03202openalex-snapshot
On the impact of MDP design for Reinforcement Learning agents in Resource Management
inferred← citeshttps://doi.org/10.48550/arxiv.2109.03739openalex-snapshot
A Dynamic, Hierarchical Resource Model for Converged Computing
inferred← citeshttps://doi.org/10.5445/ir/1000045325openalex-snapshot
Optimisation of LHCb Applications for Multi- and Manycore Job Submission
inferred← citeshttps://doi.org/10.5555/314613.315031openalex-snapshot
Analysis of first-come-first-serve parallel job scheduling
inferred← citeshttps://doi.org/10.5753/eradrs.2026.21365openalex-snapshot
Desafios e Abordagens para Alocação Dinâmica de Recursos em Sistemas HPC com MPI
inferred← citeshttps://doi.org/10.5753/sbc.8387.0.1openalex-snapshot
Desenvolvimento de Aplicações Paralelas Adaptativas: Uma Visão de Duas Décadas (2001-2021)
inferred← citeshttps://doi.org/10.5821/dissertation-2117-107944openalex-snapshot
Parallel optimization algorithms for high performance computing : application to thermal systems
inferred← citeshttps://doi.org/10.5821/dissertation-2117-350060openalex-snapshot
Scheduling and resource management solutions for the scalable and efficient design of today's and tomorrow's HPC machines
inferred← citeshttps://doi.org/10.5821/dissertation-2117-380814openalex-snapshot
Methodology for malleable applications on distributed memory systems
inferred← citeshttps://doi.org/10.70675/0dffa64az219az4f75zad36z22cea0cae813openalex-snapshot
Scheduling in cloud data center powered by renewable energy only with mixed phases-based workload
inferred← citeshttps://doi.org/10.70675/196b1a95za1f3z4349z89e3z5fdf510248a6openalex-snapshot
Parallélisation et passage à l'échelle durable d'une chaïne de traitement graphique pour l'impression professionnelle
inferred← citeshttps://doi.org/10.70675/b73f997ez64e0z4ebcz8148zad1ae4a7c57fopenalex-snapshot
Towards Malleable Distributed Storage Systems˸ From Models to Practice
inferred← citeshttps://doi.org/10.70675/ba3f126dz4f25z4069z8152z36adc37e6c6eopenalex-snapshot
Cooperative Resource Management for Parallel and Distributed Systems
inferred← citeshttps://doi.org/10.70675/bc019e47z29d3z46baz8646za3d24cbd0cf0openalex-snapshot
Energy Minimization, Data Movement and Uncertainty : Models and Algorithms
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.