Concepts inPrecise and realistic utility functions for user-centric performance analysis of schedulers

Utility

In economics, utility is a representation of preferences over some set of goods and services. Preferences have a utility representation so long as they are transitive, complete, and continuous. Utility is usually applied by economists in such constructs as the indifference curve, which plot the combination of commodities that an individual or a society would accept to maintain a given level of satisfaction.  more from Wikipedia

Profiling (computer programming)

In software engineering, profiling ("program profiling", "software profiling") is a form of dynamic program analysis that measures, for example, the usage of memory, the usage of particular instructions, or frequency and duration of function calls. The most common use of profiling information is to aid program optimization. Profiling is achieved by instrumenting either the program source code or its binary executable form using a tool called a profiler (or code profiler).  more from Wikipedia

Genetic algorithm

In the computer science field of artificial intelligence, a genetic algorithm (GA) is a search heuristic that mimics the process of natural evolution. This heuristic is routinely used to generate useful solutions to optimization and search problems. Genetic algorithms belong to the larger class of evolutionary algorithms (EA), which generate solutions to optimization problems using techniques inspired by natural evolution, such as inheritance, mutation, selection, and crossover.  more from Wikipedia

Representation theory

Representation theory is a branch of mathematics that studies abstract algebraic structures by representing their elements as linear transformations of vector spaces, and studies modules over these abstract algebraic structures. In essence, a representation makes an abstract algebraic object more concrete by describing its elements by matrices and the algebraic operations in terms of matrix addition and matrix multiplication.  more from Wikipedia

Job shop scheduling

Job shop scheduling is an optimization problem in computer science in which ideal jobs are assigned to resources at particular times. The most basic version is as follows: We are given n jobs J1, J2, ... , Jn of varying sizes, which need to be scheduled on m identical machines, while trying to minimize the makespan. The makespan is the total length of the schedule (that is, when all the jobs have finished processing).  more from Wikipedia

Function (mathematics)

In mathematics, a function is a relation between a set of inputs and a set of potential outputs with the property that each input is related to exactly one output. An example of such a relation is defined by the rule f(x) = x, which relates an input x to its square, which are both real numbers. The output of the function f corresponding to an input x is denoted by f(x) (read "f of x"). If the input is ¿3, then the output is 9, and we may write f(¿3) = 9.  more from Wikipedia

Scheduling (computing)

In computer science, scheduling is the method by which threads, processes or data flows are given access to system resources (e.g. processor time, communications bandwidth). This is usually done to load balance a system effectively or achieve a target quality of service. The need for a scheduling algorithm arises from the requirement for most modern systems to perform multitasking (execute more than one process at a time) and multiplexing (transmit multiple flows simultaneously).  more from Wikipedia