Fair Pricing Key to Node Sharing in HPC

By Alex Breslow, University of California San Diego

November 13, 2013

In HPC systems, jobs almost never share compute nodes. Each user requests the number of physical machines that they need to run their job, and then they run it in isolation.

While this practice was clearly the best choice for distributed applications in the pre-multi core era, the same is not necessarily true for the compute nodes of today, which integrate tens to hundreds of cores. Instead, distributed application co-location, whereby multiple parallel codes share the cores on sets of compute nodes, is a pragmatic choice for those seeking to optimize machine performance and power efficiency.

A previous study we did demonstrated co-locating pairs of 1024 process MPI jobs across 2048 cores decreases the run time of most applications and thus improves system throughput and energy efficiency by 10 to 20%.

Figure 1: An example of running 2 two-node jobs in isolation versus co-located: Switching from isolation (left) to co-location (right), where each socket is divided between applications improves system performance and energy efficiency.
Figure 1: An example of running 2 two-node jobs in isolation versus co-located: Switching from isolation (left) to co-location (right), where each socket is divided between applications improves system performance and energy efficiency.

However, not all applications benefit from distributed co-location: a significant number do slow down due to contention from their co-runners. While this slowdown is almost universally offset by gains in the performance of the co-running applications, and therefore still results in improved throughput, it causes an unfair inequity in pricing.This unfairness arises from the typical HPC accounting policy, which charges users proportionally to application run time. An example of this pricing unfairness is shown in Figure 2.  The plot shows the price a user running the GTC code would expect to pay when their job is co-run with each of the applications on the x-axis.  Under the current pricing model, the user would pay 60% more when their job is co-run with MILC instead of with AMG.

Figure 2: The current pricing mechanism (SOP) penalizes the user for co-locating their job by charging them more when their job degrades more.
Figure 2: The current pricing mechanism (SOP) penalizes the user for co-locating their job by charging them more when their job degrades more.

In this current pricing scheme, the user not only suffers from a decrease in utility caused by the increased job run time, but also faces an additional associated surcharge.  Our work, published and to be presented at SC’13 as one of the best paper candidates, targets this problem and introduces contention-aware fair pricing, where a user pays progressively less and less as their job is degraded more and more.

However, implementing such a policy is a challenge, as it requires a non-intrusive mechanism that precisely quantifies individual application degradation caused by co-running applications.  While previous work has employed offline profiling techniques to determine this degradation, we argue that such techniques are not always practical in a production setting, where online application behavior can significantly deviate from offline characterizations [3-6].  Instead we need a dynamic, lightweight, runtime system or OS service to detect such contention.

To satisfy these objectives, we have developed a low-overhead daemon, the Persistent Online Precise Pricing Agent (POPPA).  POPPA uses a fine-grain precise pricing shutter, a novel mechanism capable of measuring contention between applications with less than 1% overhead and with a mean absolute prediction error of 4%.  The shutter mechanism works by alternating the execution environment of each application between one where contention from co-runners is present, and one where it is effectively absent.  POPPA achieves this by cyclically pausing all but one application in a round-robin fashion and measuring the spike in the performance of the lone running application versus when it was co-located.

Figure 3: POPPA alternates application execution between isolation and co-location.  P and S are tunable parameters.
Figure 3: POPPA alternates application execution between isolation and co-location. P and S are tunable parameters.

The above shows the mechanism in action.  During the first phase, the POPPA daemon is dormant and threads from both applications execute.  Next, the instructions per cycle (IPC) of each application is derived from measurements taken using the hardware’s performance monitoring unit.  Then Job B is put to sleep, and the IPC of the Job A is measured.  Then Job B is woken up, and the IPC of both applications is measured.  This process then repeats but with Jobs A and B switching roles.

The POPPA daemon is fully parameterizable to allow for machine- and application-specific tradeoffs. In particular, we can configure the length of the periods between shutter events, the length of the shutter time, as well as the length for pre- and post-shutter measurements. Since each shutter requires all applications but one to sleep, the sleeping applications cannot make progress and thus lose performance during the shutter, which results in run time overhead.  By controlling the ratio between shutter time and shutter interval, this overhead can be carefully tuned to an acceptable value.  For our work, we decided on a shutter interval of 200 ms and a shutter length of 3.2 ms, as these values offered high prediction accuracy while keeping the average overhead under 1%.

This mechanism allows POPPA to be highly accurate, with a mean absolute error of 4%. The low prediction error stems from the fact that the system does not rely on a single measurement for determining degradation estimates, but rather can base its analysis on hundreds to thousands of fine-grain measurements that are uniformly spaced throughout the execution of each co-running application.  As a result, POPPA detects phase-level behaviors in applications that allow it to construct more accurate prediction estimates.

Based on these predictions, we then implement a fair pricing strategy and discount the user relative to their predicted degradation due to co-runner interference.  Our philosophy is that when a user’s application is degraded by 20%, the simplest and most intuitive pricing policy is to discount that user by 20%.  This policy allows the user to easily reason about how they will be priced and to also reap the benefit of a discount, which directly compensates for the additional time taken to run their job.  This compensation encourages users to embrace co-location, as the discounts allow their resource allocation to go further.

The art of precise and fair pricing is a key for designing future, agile, software systems and opens the door to new ways to utilize the rising class of multi- and many-core nodes.  If this article has piqued your interest, we invite you to our talk at the SC’13 conference (Title: “Enabling Fair Pricing on HPC Systems with Node Sharing”, to be presented on November 20th at 10:30AM in rooms 401/402/403). The contact author for this work is Alex Breslow, PhD student at the University of California San Diego.  Ananta Tiwari and Laura Carrington are research scientists at San Diego Supercomputer Center, Martin Schulz is a computer scientist at Lawrence Livermore National Laboratory, and  Lingjia Tang and Jason Mars are assistant professors in the University of Michigan EECS Department.

See Also:

 Cache pirating: Measuring the Curse of the Shared Cache. In Parallel Processing (ICPP)

Quantifying Effects of Shared On-chip Resource Interference for Consolidated Virtual Machines

Bubble-up: Increasing Utilization in Modern Warehouse Scale Computers via Sensible Co-locations

Managing Performance Interference Effects for QoS-Aware Clouds

Subscribe to HPCwire's Weekly Update!

Be the most informed person in the room! Stay ahead of the tech trends with industy updates delivered to you every week!

Exascale Escapes 2018 Budget Axe; Rest of Science Suffers

May 23, 2017

President Trump's proposed $4.1 trillion FY 2018 budget is good for U.S. exascale computing development, but grim for the rest of science and technology spend Read more…

By Tiffany Trader

Hedge Funds (with Supercomputing help) Rank First Among Investors

May 22, 2017

In case you didn’t know, The Quants Run Wall Street Now, or so says a headline in today’s Wall Street Journal. Quant-run hedge funds now control the largest Read more…

By John Russell

IBM, D-Wave Report Quantum Computing Advances

May 18, 2017

IBM said this week it has built and tested a pair of quantum computing processors, including a prototype of a commercial version. That progress follows an an Read more…

By George Leopold

PRACEdays 2017 Wraps Up in Barcelona

May 18, 2017

Barcelona has been absolutely lovely; the weather, the food, the people. I am, sadly, finishing my last day at PRACEdays 2017 with two sessions: an in-depth loo Read more…

By Kim McMahon

HPE Extreme Performance Solutions

Exploring the Three Models of Remote Visualization

The explosion of data and advancement of digital technologies are dramatically changing the way many companies do business. With the help of high performance computing (HPC) solutions and data analytics platforms, manufacturers are developing products faster, healthcare providers are improving patient care, and energy companies are improving planning, exploration, and production. Read more…

US, Europe, Japan Deepen Research Computing Partnership

May 18, 2017

On May 17, 2017, a ceremony was held during the PRACEdays 2017 conference in Barcelona to announce the memorandum of understanding (MOU) between PRACE in Europe Read more…

By Tiffany Trader

NSF, IARPA, and SRC Push into “Semiconductor Synthetic Biology” Computing

May 18, 2017

Research into how biological systems might be fashioned into computational technology has a long history with various DNA-based computing approaches explored. N Read more…

By John Russell

DOE’s HPC4Mfg Leads to Paper Manufacturing Improvement

May 17, 2017

Papermaking ranks third behind only petroleum refining and chemical production in terms of energy consumption. Recently, simulations made possible by the U.S. D Read more…

By John Russell

PRACEdays 2017: The start of a beautiful week in Barcelona

May 17, 2017

Touching down in Barcelona on Saturday afternoon, it was warm, sunny, and oh so Spanish. I was greeted at my hotel with a glass of Cava to sip and treated to a Read more…

By Kim McMahon

Exascale Escapes 2018 Budget Axe; Rest of Science Suffers

May 23, 2017

President Trump's proposed $4.1 trillion FY 2018 budget is good for U.S. exascale computing development, but grim for the rest of science and technology spend Read more…

By Tiffany Trader

Cray Offers Supercomputing as a Service, Targets Biotechs First

May 16, 2017

Leading supercomputer vendor Cray and datacenter/cloud provider the Markley Group today announced plans to jointly deliver supercomputing as a service. The init Read more…

By John Russell

HPE’s Memory-centric The Machine Coming into View, Opens ARMs to 3rd-party Developers

May 16, 2017

Announced three years ago, HPE’s The Machine is said to be the largest R&D program in the venerable company’s history, one that could be progressing tow Read more…

By Doug Black

What’s Up with Hyperion as It Transitions From IDC?

May 15, 2017

If you’re wondering what’s happening with Hyperion Research – formerly the IDC HPC group – apparently you are not alone, says Steve Conway, now senior V Read more…

By John Russell

Nvidia’s Mammoth Volta GPU Aims High for AI, HPC

May 10, 2017

At Nvidia's GPU Technology Conference (GTC17) in San Jose, Calif., this morning, CEO Jensen Huang announced the company's much-anticipated Volta architecture a Read more…

By Tiffany Trader

HPE Launches Servers, Services, and Collaboration at GTC

May 10, 2017

Hewlett Packard Enterprise (HPE) today launched a new liquid cooled GPU-driven Apollo platform based on SGI ICE architecture, a new collaboration with NVIDIA, a Read more…

By John Russell

IBM PowerAI Tools Aim to Ease Deep Learning Data Prep, Shorten Training 

May 10, 2017

A new set of GPU-powered AI software announced by IBM today brings automation to many of the tedious, time consuming and complex aspects of AI project on-rampin Read more…

By Doug Black

Bright Computing 8.0 Adds Azure, Expands Machine Learning Support

May 9, 2017

Bright Computing, long a prominent provider of cluster management tools for HPC, today released version 8.0 of Bright Cluster Manager and Bright OpenStack. The Read more…

By John Russell

Quantum Bits: D-Wave and VW; Google Quantum Lab; IBM Expands Access

March 21, 2017

For a technology that’s usually characterized as far off and in a distant galaxy, quantum computing has been steadily picking up steam. Just how close real-wo Read more…

By John Russell

Trump Budget Targets NIH, DOE, and EPA; No Mention of NSF

March 16, 2017

President Trump’s proposed U.S. fiscal 2018 budget issued today sharply cuts science spending while bolstering military spending as he promised during the cam Read more…

By John Russell

Google Pulls Back the Covers on Its First Machine Learning Chip

April 6, 2017

This week Google released a report detailing the design and performance characteristics of the Tensor Processing Unit (TPU), its custom ASIC for the inference Read more…

By Tiffany Trader

HPC Compiler Company PathScale Seeks Life Raft

March 23, 2017

HPCwire has learned that HPC compiler company PathScale has fallen on difficult times and is asking the community for help or actively seeking a buyer for its a Read more…

By Tiffany Trader

CPU-based Visualization Positions for Exascale Supercomputing

March 16, 2017

Since our first formal product releases of OSPRay and OpenSWR libraries in 2016, CPU-based Software Defined Visualization (SDVis) has achieved wide-spread adopt Read more…

By Jim Jeffers, Principal Engineer and Engineering Leader, Intel

Nvidia Responds to Google TPU Benchmarking

April 10, 2017

Last week, Google reported that its custom ASIC Tensor Processing Unit (TPU) was 15-30x faster for inferencing workloads than Nvidia's K80 GPU (see our coverage Read more…

By Tiffany Trader

TSUBAME3.0 Points to Future HPE Pascal-NVLink-OPA Server

February 17, 2017

Since our initial coverage of the TSUBAME3.0 supercomputer yesterday, more details have come to light on this innovative project. Of particular interest is a ne Read more…

By Tiffany Trader

Nvidia’s Mammoth Volta GPU Aims High for AI, HPC

May 10, 2017

At Nvidia's GPU Technology Conference (GTC17) in San Jose, Calif., this morning, CEO Jensen Huang announced the company's much-anticipated Volta architecture a Read more…

By Tiffany Trader

Leading Solution Providers

Facebook Open Sources Caffe2; Nvidia, Intel Rush to Optimize

April 18, 2017

From its F8 developer conference in San Jose, Calif., today, Facebook announced Caffe2, a new open-source, cross-platform framework for deep learning. Caffe2 is Read more…

By Tiffany Trader

Tokyo Tech’s TSUBAME3.0 Will Be First HPE-SGI Super

February 16, 2017

In a press event Friday afternoon local time in Japan, Tokyo Institute of Technology (Tokyo Tech) announced its plans for the TSUBAME3.0 supercomputer, which w Read more…

By Tiffany Trader

Is Liquid Cooling Ready to Go Mainstream?

February 13, 2017

Lost in the frenzy of SC16 was a substantial rise in the number of vendors showing server oriented liquid cooling technologies. Three decades ago liquid cooling Read more…

By Steve Campbell

MIT Mathematician Spins Up 220,000-Core Google Compute Cluster

April 21, 2017

On Thursday, Google announced that MIT math professor and computational number theorist Andrew V. Sutherland had set a record for the largest Google Compute Eng Read more…

By Tiffany Trader

IBM Wants to be “Red Hat” of Deep Learning

January 26, 2017

IBM today announced the addition of TensorFlow and Chainer deep learning frameworks to its PowerAI suite of deep learning tools, which already includes popular Read more…

By John Russell

HPC Technique Propels Deep Learning at Scale

February 21, 2017

Researchers from Baidu's Silicon Valley AI Lab (SVAIL) have adapted a well-known HPC communication technique to boost the speed and scale of their neural networ Read more…

By Tiffany Trader

US Supercomputing Leaders Tackle the China Question

March 15, 2017

As China continues to prove its supercomputing mettle via the Top500 list and the forward march of its ambitious plans to stand up an exascale machine by 2020, Read more…

By Tiffany Trader

DOE Supercomputer Achieves Record 45-Qubit Quantum Simulation

April 13, 2017

In order to simulate larger and larger quantum systems and usher in an age of "quantum supremacy," researchers are stretching the limits of today's most advance Read more…

By Tiffany Trader

  • arrow
  • Click Here for More Headlines
  • arrow
Share This