Return-Path: X-Original-To: apmail-aurora-issues-archive@minotaur.apache.org Delivered-To: apmail-aurora-issues-archive@minotaur.apache.org Received: from mail.apache.org (hermes.apache.org [140.211.11.3]) by minotaur.apache.org (Postfix) with SMTP id C8EC3178B0 for ; Mon, 13 Apr 2015 20:59:12 +0000 (UTC) Received: (qmail 23448 invoked by uid 500); 13 Apr 2015 20:59:12 -0000 Delivered-To: apmail-aurora-issues-archive@aurora.apache.org Received: (qmail 23404 invoked by uid 500); 13 Apr 2015 20:59:12 -0000 Mailing-List: contact issues-help@aurora.apache.org; run by ezmlm Precedence: bulk List-Help: List-Unsubscribe: List-Post: List-Id: Reply-To: dev@aurora.apache.org Delivered-To: mailing list issues@aurora.apache.org Received: (qmail 23394 invoked by uid 99); 13 Apr 2015 20:59:12 -0000 Received: from arcas.apache.org (HELO arcas.apache.org) (140.211.11.28) by apache.org (qpsmtpd/0.29) with ESMTP; Mon, 13 Apr 2015 20:59:12 +0000 Date: Mon, 13 Apr 2015 20:59:12 +0000 (UTC) From: "Chris Lambert (JIRA)" To: issues@aurora.apache.org Message-ID: In-Reply-To: References: Subject: [jira] [Updated] (AURORA-1219) Improve preemptor efficiency MIME-Version: 1.0 Content-Type: text/plain; charset=utf-8 Content-Transfer-Encoding: 7bit X-JIRA-FingerPrint: 30527f35849b9dde25b450d4833f0394 [ https://issues.apache.org/jira/browse/AURORA-1219?page=com.atlassian.jira.plugin.system.issuetabpanels:all-tabpanel ] Chris Lambert updated AURORA-1219: ---------------------------------- Story Points: 5 > Improve preemptor efficiency > ---------------------------- > > Key: AURORA-1219 > URL: https://issues.apache.org/jira/browse/AURORA-1219 > Project: Aurora > Issue Type: Task > Components: Scheduler > Reporter: Maxim Khutornenko > Assignee: Maxim Khutornenko > > While AURORA-1158 makes the preemptor asynchronous and helps scheduling loop performance, it loses some preemption efficiency due to adapting the original algorithm to work asynchronously: > - Preemptor repeatedly searches for preemption slots with the same ClusterState increasing the probability of victim collisions. > - Slave/offer/resource mappings are redundantly recomputed for every pending task slot search. > - Pending tasks are repeatedly sized up against every slave (as opposed to the other way around) making internal loop optimizations more expensive (i.e. pending task count is expected to be << slave count under normal conditions). -- This message was sent by Atlassian JIRA (v6.3.4#6332)