Automation of dynamic partitioning of heterogeneous tasks[1] among
semi homogenous resources[2] via exploitation of consistency in the long term
and short term behaviour of the system inputs[3]. Maximization of throughput minimization of latency and guarantees
on starvation avoidance all being key goals. I say this only because it's, 1)
Hard (NP complete in fact) 2)
Would be useful to us 3)
It's a lot of buzz words for a title :) [1] think NUMA, differing amounts of memory, differing numbers
of cores etc but with considerable similarities [2] tasks requiring differing numbers of cores, memory and with
widely varying runtimes. [3] despite the complexity in 1 and 2 it is likely that there
exist steady state periods when optimal/close to optimal arrangements exist
and can be predicted. Matt From: condor-users-bounces@xxxxxxxxxxx
[mailto:condor-users-bounces@xxxxxxxxxxx] On Behalf Of Shouqin Zhu Greeting to all, Do you have any good ideas? ---- Gloucester Research Limited believes the information provided herein is reliable. While every care has been taken to ensure accuracy, the information is furnished to the recipients with no warranty as to the completeness and accuracy of its contents and on condition that any errors or omissions shall not be made the basis for any claim, demand or cause for action. The information in this email is intended only for the named recipient. If you are not the intended recipient please notify us immediately and do not copy, distribute or take action based on this e-mail. All messages sent to and from this email address will be logged by Gloucester Research Ltd and are subject to archival storage, monitoring, review and disclosure. Gloucester Research Limited, 5th Floor, Whittington House, 19-30 Alfred Place, London WC1E 7EA. Gloucester Research Limited is a company registered in England and Wales with company number 04267560. ----
|