Export Citations
Save this search
Please login to be able to save your searches and receive alerts for new content matching your search criteria.
- short-paperSeptember 2023
Defining a canonical unit for accounting purposes
PEARC '23: Practice and Experience in Advanced Research Computing 2023: Computing for the Common GoodPages 288–291https://doi.org/10.1145/3569951.3597574Compute resource providers often put in place batch compute systems to maximize the utilization of such resources. However, compute nodes in such clusters, both physical and logical, contain several complementary resources, with notable examples being ...
- posterAugust 2021
Steal task scheduling from OS: enabling task-network co-schedule for time-critical traffic
SIGCOMM '21: Proceedings of the SIGCOMM '21 Poster and Demo SessionsPages 53–55https://doi.org/10.1145/3472716.3472868Real-Time Ethernet (RT Ethernet) such as Time-Sensitive Networking and Time-Triggered Ethernet is widely deployed in the distributed real-time systems such as aerospace, automotive and industrial domains\cite{craciunas2016combined}. Typically, there are ...
- research-articleAugust 2019
Holistic Slowdown Driven Scheduling and Resource Management for Malleable Jobs
ICPP '19: Proceedings of the 48th International Conference on Parallel ProcessingArticle No.: 31, Pages 1–10https://doi.org/10.1145/3337821.3337909In job scheduling, the concept of malleability has been explored since many years ago. Research shows that malleability improves system performance, but its utilization in HPC never became widespread. The causes are the difficulty in developing ...
- research-articleJanuary 2018
Resilient co-scheduling of malleable applications
International Journal of High Performance Computing Applications (SAGE-HPCA), Volume 32, Issue 1Pages 89–103https://doi.org/10.1177/1094342017704979Recently, the benefits of co-scheduling several applications have been demonstrated in a fault-free context, both in terms of performance and energy savings. However, large-scale computer systems are confronted by frequent failures, and resilience ...
- research-articleJanuary 2014
Exploiting Performance Counters for Energy Efficient Co-Scheduling of Mixed Workloads on Multi-Core Platforms
PARMA-DITAM '14: Proceedings of Workshop on Parallel Programming and Run-Time Management Techniques for Many-core Architectures and Design Tools and Architectures for Multicore Embedded Computing PlatformsPages 27–32https://doi.org/10.1145/2556863.2556866Mainstream multicore architectures allow the execution of mixed workloads where multiple parallel applications run concurrently competing on shared computational resources. As different applications exhibit different and time varying resources needs, a ...
- research-articleJune 2012
Virtual network on demand: dedicating network resources to distributed scientific workflows
DIDC '12: Proceedings of the fifth international workshop on Data-Intensive Distributed Computing DatePages 53–62https://doi.org/10.1145/2286996.2287006The VNOD project aims to build an on-demand network virtualization infrastructure that can deliver the unprecedented networking performance and quality of service required by modern, distributed, data-intensive applications utilized by user communities. ...
- research-articleMay 2012
Linux kernel co-scheduling and bulk synchronous parallelism
International Journal of High Performance Computing Applications (SAGE-HPCA), Volume 26, Issue 2Pages 136–145https://doi.org/10.1177/1094342011433523This paper describes a kernel scheduling algorithm that is based on co-scheduling principles and that is intended for parallel applications running on 1000 cores or more. Experimental results for a Linux implementation on a Cray XT5 machine are ...
- research-articleMay 2011
Linux kernel co-scheduling for bulk synchronous parallel applications
ROSS '11: Proceedings of the 1st International Workshop on Runtime and Operating Systems for SupercomputersPages 57–64https://doi.org/10.1145/1988796.1988805This paper describes a kernel scheduling algorithm that is based on co-scheduling principles and that is intended for parallel applications running on 1000 cores or more where inter-node scalability is key. Experimental results for a Linux ...
- ArticleMarch 2011
VM Co-scheduling: Approximation of Optimal Co-scheduling in Data Center
AINA '11: Proceedings of the 2011 IEEE International Conference on Advanced Information Networking and ApplicationsPages 340–347https://doi.org/10.1109/AINA.2011.12Multi-resource sharings among virtual machines (VM)are very important in data center, but also bring contentions for cache, disk and network in host server. Recent studies focus primarily on locally optimizing resource sharings in a single server, or ...
- research-articleMay 2009
A study on optimally co-scheduling jobs of different lengths on chip multiprocessors
CF '09: Proceedings of the 6th ACM conference on Computing frontiersPages 41–50https://doi.org/10.1145/1531743.1531752Cache sharing in Chip Multiprocessors brings cache contention among corunning processes, which often causes considerable degradation of program performance and system fairness. Recent studies have seen the effectiveness of job co-scheduling in ...
- research-articleOctober 2008
Analysis and approximation of optimal co-scheduling on chip multiprocessors
PACT '08: Proceedings of the 17th international conference on Parallel architectures and compilation techniquesPages 220–229https://doi.org/10.1145/1454115.1454146Cache sharing among processors is important for Chip Multiprocessors to reduce inter-thread latency, but also brings cache contention, degrading program performance considerably. Recent studies have shown that job co-scheduling can effectively alleviate ...
- ArticleJuly 2008
A Study of Adaptive Co-scheduling Approach for an Opportunistic Software Environment to Execute in Multi-core and Multi-Processor Configurations
CSE '08: Proceedings of the 2008 11th IEEE International Conference on Computational Science and EngineeringPages 41–47https://doi.org/10.1109/CSE.2008.53Multi-cores and multi-processors loosely coupled are being considered interesting architectures to increase computational power in many organizations. However, these environments brought a new challenge for the scientific community that can be ...
- articleOctober 2006
Distributed and collaborative visualization of large data sets using high-speed networks
- Andrei Hutanu,
- Gabrielle Allen,
- Stephen D. Beck,
- Petr Holub,
- Hartmut Kaiser,
- Archit Kulshrestha,
- Miloš Liška,
- Jon MacLaren,
- Luděk Matyska,
- Ravi Paruchuri,
- Steffen Prohaska,
- Ed Seidel,
- Brygg Ullmer,
- Shalini Venkataraman
Future Generation Computer Systems (FGCS), Volume 22, Issue 8Pages 1004–1010https://doi.org/10.1016/j.future.2006.03.026We describe an architecture for distributed collaborative visualization that integrates video conferencing, distributed data management and grid technologies as well as tangible interaction devices for visualization. High-speed, low-latency optical ...
- research-articleFebruary 2006
Hybrid Preemptive Scheduling of Message Passing Interface Applications on Grids
International Journal of High Performance Computing Applications (SAGE-HPCA), Volume 20, Issue 1Pages 77–90https://doi.org/10.1177/1094342006062526Time sharing between cluster resources in a grid is a major issue in cluster and grid integration. Classical grid architecture involves a higher-level scheduler which submits non-overlapping jobs to the independent batch schedulers of each cluster of ...
- articleMarch 2002
A Theory for Co-Scheduling Hardware and Software Pipelines in ASIPs and Embedded Processors
Design Automation for Embedded Systems (DAES), Volume 6, Issue 3Pages 243–275https://doi.org/10.1023/A:1014050303852Exploiting instruction-level parallelism (ILP) is extremely important for achieving high performance in application specific instruction set processors (ASIPs) and embedded processors. Unlike conventional general purpose processors, ASIPs and embedded ...
- ArticleApril 2000
Scheduling with Global Information in Distributed Systems
Buffered co-scheduling is a distributed scheduling methodology for time-sharing communicating processes in a distributed system, e.g., PC cluster. The principle mechanisms involved in this methodology are communication buffering and strobing. With ...
- ArticleMarch 1999
An Economic Approach to Adaptive Resource Management
Resource management is a fundamental concept in operating system design. In recent years it has become fashionable to consider the problem as an aspect of heterogeneous support for Quality of Service (`QoS'). The desire for QoS support leads to the dual ...