WO2010058246A1 - Gestion de multiples fournisseurs de ressource - Google Patents

Gestion de multiples fournisseurs de ressource Download PDF

Info

Publication number
WO2010058246A1
WO2010058246A1 PCT/IB2008/054917 IB2008054917W WO2010058246A1 WO 2010058246 A1 WO2010058246 A1 WO 2010058246A1 IB 2008054917 W IB2008054917 W IB 2008054917W WO 2010058246 A1 WO2010058246 A1 WO 2010058246A1
Authority
WO
WIPO (PCT)
Prior art keywords
resource
load
application
data carrier
set forth
Prior art date
Application number
PCT/IB2008/054917
Other languages
English (en)
Inventor
Vladimir Litovtchenko
Florian Bogenberger
Original Assignee
Freescale Semiconductor, Inc.
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Freescale Semiconductor, Inc. filed Critical Freescale Semiconductor, Inc.
Priority to PCT/IB2008/054917 priority Critical patent/WO2010058246A1/fr
Priority to US13/128,025 priority patent/US8752061B2/en
Publication of WO2010058246A1 publication Critical patent/WO2010058246A1/fr

Links

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F9/00—Arrangements for program control, e.g. control units
    • G06F9/06—Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
    • G06F9/46—Multiprogramming arrangements
    • G06F9/50—Allocation of resources, e.g. of the central processing unit [CPU]
    • G06F9/5005—Allocation of resources, e.g. of the central processing unit [CPU] to service a request
    • G06F9/5027—Allocation of resources, e.g. of the central processing unit [CPU] to service a request the resource being a machine, e.g. CPUs, Servers, Terminals
    • G06F9/505—Allocation of resources, e.g. of the central processing unit [CPU] to service a request the resource being a machine, e.g. CPUs, Servers, Terminals considering the load
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F2209/00—Indexing scheme relating to G06F9/00
    • G06F2209/50—Indexing scheme relating to G06F9/50
    • G06F2209/5019—Workload prediction
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F2209/00—Indexing scheme relating to G06F9/00
    • G06F2209/50—Indexing scheme relating to G06F9/50
    • G06F2209/504—Resource capping
    • Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
    • Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
    • Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
    • Y02D10/00—Energy efficient computing, e.g. low power processors, power management or thermal management

Definitions

  • This invention relates to a data carrier carrying instructions for management of multiple resources providers.
  • the invention further relates to a device comprising at least one processor, a data carrier, and a set of resource providers, the set of resource providers possibly including the at least one processor.
  • a resource is understood to be any measurable quantity that is provided by a resource provider.
  • the resource may for example be one of the following: memory, processing time, data throughput, power, and device usage.
  • the device usage may, for example, be usage of a processor, printer, scanner, detector or any other component or peripheral of an information processing system.
  • a share of a resource is usually allocated upon a request made by a component of the information processing device or by another device.
  • a processor of the information processing device may request a certain share of the memory of the information processing device, wherein the memory is distributed over a plurality of memory providers such as random-access memory chips and hard disks.
  • Various methods are known by which one of a plurality of resource providers can be selected to provide the requested share of the resource.
  • a problem may occur in that after a request has been assigned to a resource provider, it may turn out that the application associated with the request may require additional amounts of the resource while the resource provider's capacity is not sufficient for providing the additional amount of resource. In this case the application may be interrupted in an undesirable manner or fail altogether.
  • the present invention provides a data carrier and a device as described in the accompanying claims.
  • Figure 1 shows a flow chart illustrating in a simplified manner an example of a method for selecting a resource provider from a given set of resource providers.
  • Figure 2 schematically illustrates an example of a resource management system.
  • Figure 3 schematically illustrates further features of the resource management system.
  • Figure 4 provides an overview on various databases which may be part of the resource management system.
  • Figure 5 schematically illustrates a step of determining a total expected load on a resource provider for a given request.
  • Figure 6 schematically illustrates determining the total expected loads for two resource providers.
  • Fig. 1 Schematically illustrated in Fig. 1 is an example of a method in which a particular resource provider is selected from a set of resource providers in order to provide a share of a resource in response to a request.
  • the resource providers all provide the same type of resource, for example, memory (of dimension bits) or data throughput (of dimension bits per second).
  • a request for a share of the resource is generated by an application or in response to an application.
  • the application may, for example, be a process running on a computer, or a mechanical process, such as the motion of a piston of an engine.
  • an expected application state is determined on the basis of the request and possibly on the current state of the application.
  • the expected application state may for example be inferred from a lookup table indicating a mapping between a set of request types and a set of possible transitions between application states. This may be facilitated by knowing the current state of the application. To this end, an entry indicating the current application state may be kept and updated each time the application undergoes a transition from one application state to another.
  • the lookup table may comprise sub-tables, each sub-table containing the possible transitions for one specific application state, there being one sub-table for each application state.
  • a database is read in order to determine an expected additional amount of the resource as a function of the expected application state.
  • the additional amount of the resource is an amount of the resource which is expected to be required once the application has assumed its expected application state.
  • the requested amount of the resource and the additional amount of the resource may be, respectively, the memory required for loading a program and the amount of memory which is dynamically loaded during execution of the program.
  • a list of expected total loads is determined, the list indicating for each of the resource providers an expected total load.
  • the expected total load is determined on the basis of at least the following loads: the current load of the resource provider, the load corresponding to the additional amount of the resource, and the load corresponding to the requested amount of the resource.
  • a load is understood to be the ratio of the amount of resource that is actually provided by a particular resource provider at a given instant and the maximum amount of resource that can be provided by the resource provider.
  • a preferred resource provider is selected from the set of resource providers based on the list of expected total loads.
  • the preferred resource provider may, for example, be the resource provider having the smallest expected total load.
  • step S16 it is determined whether the expected total load of the preferred resource provider is less than a predefined maximum load, the predefined maximum load being equal or less than 100%. If so, a task for which the resource request was made is assigned to the preferred resource provider, in the sense that the preferred resource provider is instructed to process the task. Otherwise the process returns to step 14, whereby the list of expected loads is determined at a later moment. The method ends in step S17.
  • the system 10 comprises a processor 12 and four resource providers 30, 32, 34, 36.
  • the system 10 further comprises two dynamic databases 16, 18.
  • the database 16 indicates the current individual loads of the resource providers 30, 32, 34, 36, while the database 18 indicates the current state of the application (current application state).
  • the system 10 also comprises three static databases 20, 22, 24, namely, the "Application Transitions and States” database 20, the "Resource Load for processing Resource Request Type” database 22, and the "Expected Resource Load for Application States” database 24.
  • the system 10 operates as follows.
  • the processor 12 receives an incoming request 26 or an incoming identifier identifying an intended transition of an application state.
  • the processor 12 determines an expected application state. Based on the expected application state, the processor 12 reads, for each of the resource providers 30, 32, 34, and 36, an expected load from the "Expected Resource Load for Application States” database 24, the expected load corresponding to the amount of resource likely to be required in the expected application state. The processor 12 further reads from the "Resource Load for processing Resource Request Type" database 22 for each of the resource providers 30, 32, 34, 36 a requested load corresponding to the received request 26.
  • the processor For each of the resource providers 30, 32, 34, 36, the processor sums the current load, the requested load, and the expected load, thereby generating a list of expected total loads (the "Prioritized Table of Possible Solutions"), the list indicating an expected total load for each of the resource providers 30, 32, 34, and 36.
  • a resource manager 14 selects from the list the resource provider (30, 32, 34, or 36) having the smallest expected total load, that resource provider being referred to as the preferred resource provider. If its expected total load is less or equal 100%, the resource manager 14 allocates the corresponding amount of resource on the preferred resource provider.
  • a "Resource State" controller 38 updates the data base 16 so as to indicate the new current loads of the resource providers. Similarly, once a task performed by one of the resource providers 30, 32, 34, 36 has been terminated, the corresponding load is deallocated on the resource provider, and the data base 16 is again updated. - A -
  • Fig. 3 there is illustrated an operational mode of the resource management system 10 as described above, for a specific example in which the application is characterized by a flow control graph 40 having a first application state 42 (IST1 ) and a second application state 44 (IST2).
  • the allowed transitions are a first transition 46 (T1 ) from the first state 42 to the second state 44, a second transition 48 (T2) from the second state 44 to the first state 42, and a third transition 50 (T3) from the second state 44 to the same state 44.
  • the system 10 maintains a first counter value 64 and a second counter value 66 indicating the number of times a request corresponding to a transition to the first state 42 and to the second state 44, respectively, has been received but not granted. If one of the counter values has reached a maximum value, an error message is generated and further requests of the same type are rejected immediately. If on the other hand a request of the type has been granted, the respective counter value is decremented by one.
  • the static and dynamic databases mentioned above are listed in Fig. 4.
  • the "Application Transitions and States” static database 20 contains data indicating all possible application states and transitions of the application.
  • the database contains data equivalent to the flow control graph 40 comprising the two application states IST1 and IST2, and the three transitions T1 , T2, T3.
  • the "Resource Load for processing Resource Request Type” static database 22 contains data indicating for each of a variety of resource request types and for each of the resource providers 30, 32, 34, 36 a corresponding resource load.
  • a first, second, and third request type correspond to the first, second, and third transition, respectively.
  • the load associated with the first request type is 10% for the first resource provider 30 and 30% for the second resource provider 32.
  • the load associated with the second request type is 24% for the first resource provider 30 and 35% for the second resource provider 32
  • the load associated with the third request type is 0.7% for the first resource provider 30 and 12% for the second resource provider 32.
  • the "Expected Resource Load for Application States" static database 24 contains data indicating for each of the application states of the application and for each of the resource providers 30, 32, 34, 36 an expected resource load.
  • the expected resource load for the application state IST1 is 55% for the first resource provider 30 and 75% for the second resource provider.
  • the expected resource load is 30% for the first resource provider 30 and 45% for the second resource provider 32.
  • the "Current Resource State” dynamic database 16 contains data reflecting the current loads of the resource providers 30, 32, 34, 36. In the example given, the current loads of the first resource provider 30 and the second resource provider 32 are 5% and 15%, respectively.
  • the "Abstracted Application State” dynamic database 18 contains data indicating the current application state as determined from resource requests received by the processor 12. In the present example, the current application state is the first application state IST1.
  • Fig. 5 Represented in Fig. 5 is an example of the way in which the expected total loads are evaluated for each of the resource providers 30, 32, 34, 36. Each pair of brackets in the figure indicates a column vector, each line of which refers to one of the resource providers 30, 32, 34, 36.
  • a "Current Resource State” vector 62 indicates the current loads of the resource providers.
  • An “Expected Resource Load” vector 60 indicates the expected resource loads of the resource provider as determined from the "Expected Resource Load for Application States" database 24.
  • a “Resource Request Load” vector 58 indicates the loads corresponding to the requested amount of the resource.
  • the vectors 58, 60, and 62 are summed to yield an "Estimated Total Load" vector 52, each line of which corresponds to one of the resource providers 30, 32, 34, 36 and indicates the estimated total load for that resource provider.
  • the estimated total load is a hypothetical load, namely, it is the total load of the resource provider which would result if the requested amount of the resource were allocated on that resource provider.
  • the estimated total load may well exceed 100%. In this case the requested amount of the resource cannot be allocated on the respective resource provider.
  • Fig. 6 illustrates, in an exemplary manner, possible values of the vectors 52, 58, 60, 62.
  • the first line 54 and the second line 56 of the vector equation correspond to the first resource provider 30 and to the second resource provider 32, respectively.
  • the application is in the first state IST1 and that a request for a transition from the first state IST1 to the second state IST2 has been received.
  • the values of the vectors 58, 60, 62 are, respectively, 10%, 30%, and 5% in the first line 54 and 30%, 45%, and 15% in the second line 56.
  • Expected total loads for the third resource provider 36 and the fourth resource provider 38 are computed analogously (not shown). Again it is pointed out that the expected total loads are hypothetical in the sense that they indicate the load of a given resource provider that would occur if the corresponding request were assigned to that resource provider.
  • a priority list is generated, the list indicating the resource providers 30, 32, 34, 36 in an order corresponding to their respective expected total load, the resource provider having the lowest expected total load (in the example, the first resource provider 30) being on top of the list.
  • the resource manager 14 described above with reference to Fig. 1 subsequently allocates the requested amount of the resource on the resource provider on top of the list; if this fails for one reason or another, the resource manager 14 tries allocating the requested amount of the resource on the resource provider coming next in the priority list. More generally, the resource manager 14 tries to allocate the requested amount of the resource to one of the resource providers in an order prescribed by the priority list.
  • a resource provider is selected as follows.
  • a request 26 for an amount of a resource is received.
  • the resource may be one of the following: memory, processing time, data throughput, power, and usage of a device.
  • An expected state 44 of an application is determined on the basis of the request 26.
  • a transition 46 in the control flow graph 40 of the application is also determined on the basis of the request 26.
  • usage is made of data 20 indicating application states 42, 44 and/or possible transitions 46, 48, 50 between the application states. Usage is also made of data 24 indicating for each of the application states 42, 44 an additional amount of the resource.
  • Usage is also made of data indicating for each of the application states 42, 44 and for each of the resource providers 30, 32, 34, 36 an additional load 60. Usage is also made of data 22 indicating for each of a variety of request types an amount of the resource, or indicating for each of a variety of request types and for each of the resource providers 30, 32, 34, 36 a load. For each resource provider in a set of resource providers 30, 32, 34, 36, a current load 62, a requested load 58 corresponding to the requested amount of the resource, and an additional load 60 corresponding to an expected state 44 of an application are determined.
  • an expected total load 52 is determined for each of the resource providers 30, 32, 34, 36, for example, by computing for each of the resource providers 30, 32, 34, 36 the sum of the current load 62, the requested load 58, and the additional load 60.
  • a preferred resource provider 30 is selected from the set of resource providers 30, 32, 34, 36. For example, the resource provider 30 having the smallest expected total load 52 may be selected as the preferred resource provider.
  • an entry 16 indicating a current state 42 of the application is updated. The number of times a request of a specific type has been rejected may be counted.
  • the application may or may not be executed by the device which selects the preferred resource provider. It is also noted that several applications may use the resource providers simultaneously.
  • Instructions for perfoming steps similar or identical to the steps described above may be stored on a data carrier (not shown).
  • the invention may also be implemented in a computer program for running on a computer system, at least including code portions for performing steps of a method according to the invention when run on a programmable apparatus, such as a computer system, or enabling a programmable apparatus to perform functions of a device or system according to the invention.
  • the computer program may for instance include one or more of: a subroutine, a function, a procedure, an object method, an object implementation, an executable application, an applet, a servlet, a source code, an object code, a shared library/dynamic load library and/or other sequence of instructions designed for execution on a computer system.
  • the computer program may be provided on a data carrier, such as a CD-ROM or diskette, stored with data loadable in a memory of a computer system, the data representing the computer program.
  • the data carrier may further be a data connection, such as a telephone cable or a wireless connection.
  • FIG. 2 and the discussion thereof describe an exemplary information processing architecture
  • this exemplary architecture is presented merely to provide a useful reference in discussing various aspects of the invention.
  • the description of the architecture has been simplified for purposes of discussion, and it is just one of many different types of appropriate architectures that may be used in accordance with the invention.
  • Those skilled in the art will recognize that the boundaries between logic blocks are merely illustrative and that alternative embodiments may merge logic blocks or circuit elements or impose an alternate decomposition of functionality upon various logic blocks or circuit elements.
  • any two components herein combined to achieve a particular functionality can be seen as “associated with” each other such that the desired functionality is achieved, irrespective of architectures or intermedial components.
  • any two components so associated can also be viewed as being “operably connected,” or “operably coupled,” to each other to achieve the desired functionality.
  • boundaries between the functionality of the above described operations merely illustrative. The functionality of multiple operations may be combined into a single operation, and/or the functionality of a single operation may be distributed in additional operations.
  • alternative embodiments may include multiple instances of a particular operation, and the order of operations may be altered in various other embodiments.
  • All or some of the software described herein may be received from elements of the device 10, for example, from computer readable media such as a memory of the device 10 or other media on other computer systems.
  • computer readable media such as a memory of the device 10 or other media on other computer systems.
  • Such computer readable media may be permanently, removably or remotely coupled to an information processing system such as the device 10.
  • the computer readable media may include, for example and without limitation, any number of the following: magnetic storage media including disk and tape storage media; optical storage media such as compact disk media (e.g., CD-ROM, CD-R, etc.) and digital video disk storage media; nonvolatile memory storage media including semiconductor-based memory units such as FLASH memory, EEPROM, EPROM, ROM; ferromagnetic digital memories; MRAM; volatile storage media including registers, buffers or caches, main memory, RAM, etc.; and data transmission media including computer networks, point-to-point telecommunication equipment, and carrier wave transmission media, just to name a few.
  • magnetic storage media including disk and tape storage media
  • optical storage media such as compact disk media (e.g., CD-ROM, CD-R, etc.) and digital video disk storage media
  • nonvolatile memory storage media including semiconductor-based memory units such as FLASH memory, EEPROM, EPROM, ROM
  • ferromagnetic digital memories such as FLASH memory, EEPROM, EPROM, ROM
  • the device 10 is a computer system such as a personal computer system.
  • Computer systems are information handling systems which can be designed to give independent computing power to one or more users.
  • Computer systems may be found in many forms including but not limited to mainframes, minicomputers, servers, workstations, personal computers, notepads, personal digital assistants, electronic games, automotive and other embedded systems, cell phones and various other wireless devices.
  • a typical computer system includes at least one processing unit, associated memory and a number of input/output (I/O) devices.
  • a computer system processes information according to a program and produces resultant output information via I/O devices.
  • a program is a list of instructions such as a particular application program and/or an operating system.
  • a computer program is typically stored internally on computer readable storage medium or transmitted to the computer system via a computer readable transmission medium.
  • a computer process typically includes an executing (running) program or portion of a program, current program values and state information, and the resources used by the operating system to manage the execution of the process.
  • a parent process may spawn other, child processes to help perform the overall functionality of the parent process. Because the parent process specifically spawns the child processes to perform a portion of the overall functionality of the parent process, the functions performed by child processes (and grandchild processes, etc.) may sometimes be described as being performed by the parent process.
  • the invention is not limited to physical devices or units implemented in nonprogrammable hardware but can also be applied in programmable devices or units able to perform the desired device functions by operating in accordance with suitable program code.
  • the devices may be physically distributed over a number of apparatuses, while functionally operating as a single device.
  • devices functionally forming separate devices may be integrated in a single physical device.
  • any reference signs placed between parentheses shall not be construed as limiting the claim.
  • the word “comprising” does not exclude the presence of other elements or steps those listed in a claim.
  • the terms “a” or “an,” as used herein, are defined as one or more than one.

Abstract

L'invention porte sur un dispositif (10) qui reçoit une requête (26) pour une quantité d'une ressource. Il détermine pour chaque fournisseur de ressource dans un ensemble de fournisseurs de ressource (30, 32, 34, 36) une charge courante (62), une charge demandée (58) correspondant à la quantité demandée de la ressource, et une charge supplémentaire (60) correspondant à un état attendu (44) d'une application. Il détermine pour chacun des fournisseurs de ressource (30, 32, 34, 36) une charge totale attendue (52) sur la base de la charge courante (62), de la charge demandée (58), et de la charge supplémentaire (60). Il sélectionne ultérieurement à partir de l'ensemble de fournisseurs de ressource (30, 32, 34, 36) un fournisseur de ressource préféré (30) sur la base des charges totales attendues (52). La ressource peut être l'un des éléments suivants : une mémoire, un temps de traitement, un débit de données, une puissance et une utilisation d'un dispositif.
PCT/IB2008/054917 2008-11-24 2008-11-24 Gestion de multiples fournisseurs de ressource WO2010058246A1 (fr)

Priority Applications (2)

Application Number Priority Date Filing Date Title
PCT/IB2008/054917 WO2010058246A1 (fr) 2008-11-24 2008-11-24 Gestion de multiples fournisseurs de ressource
US13/128,025 US8752061B2 (en) 2008-11-24 2008-11-24 Resource allocation within multiple resource providers based on the incoming resource request and the expected state transition of the resource requesting application, and selecting a resource provider based on the sum of the percentage of the resource provider currently used, the requesting load as a percentage of the resource provider's total resource, and the additional load imposed by the expected state of the requesting application as a percentage of the resource provider's total resource

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
PCT/IB2008/054917 WO2010058246A1 (fr) 2008-11-24 2008-11-24 Gestion de multiples fournisseurs de ressource

Publications (1)

Publication Number Publication Date
WO2010058246A1 true WO2010058246A1 (fr) 2010-05-27

Family

ID=40467103

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/IB2008/054917 WO2010058246A1 (fr) 2008-11-24 2008-11-24 Gestion de multiples fournisseurs de ressource

Country Status (2)

Country Link
US (1) US8752061B2 (fr)
WO (1) WO2010058246A1 (fr)

Families Citing this family (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2011144965A1 (fr) * 2010-05-18 2011-11-24 Freescale Semiconductor, Inc. Dispositif à circuits intégrés, système de traitement de signaux et procédé de gestion des ressources en énergie d'un système de traitement de signaux
US9003416B2 (en) * 2010-09-29 2015-04-07 International Business Machines Corporation Predicting resource requirements for a computer application
WO2014198001A1 (fr) * 2013-06-14 2014-12-18 Cirba Inc Système et procédé permettant de déterminer la capacité dans des environnements informatiques à l'aide de profils de demandes
US10243456B2 (en) 2017-06-02 2019-03-26 Nxp Usa, Inc. Voltage regulator with load current prediction and method therefor
CN113225830B (zh) * 2021-06-07 2023-05-26 维沃移动通信有限公司 数据网络上行调度方法、装置及电子设备
WO2023153898A1 (fr) * 2022-02-14 2023-08-17 삼성전자주식회사 Dispositif électronique de gestion de ressources matérielles, et procédé de fonctionnement associé

Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20050149940A1 (en) * 2003-12-31 2005-07-07 Sychron Inc. System Providing Methodology for Policy-Based Resource Allocation
WO2005078580A1 (fr) * 2004-02-06 2005-08-25 Intel Corporation Procede de reduction de la consommation d'energie d'applications tamponnees a l'aide de processeur multitache simultane

Family Cites Families (11)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US7392390B2 (en) * 2001-12-12 2008-06-24 Valve Corporation Method and system for binding kerberos-style authenticators to single clients
US7813993B1 (en) * 2002-08-30 2010-10-12 Advanced Micro Devices, Inc. Method and apparatus for scheduling a resource
US8122453B2 (en) * 2003-02-04 2012-02-21 International Business Machines Corporation Method and system for managing resources in a data center
US8533716B2 (en) 2004-03-31 2013-09-10 Synopsys, Inc. Resource management in a multicore architecture
US7984447B1 (en) * 2005-05-13 2011-07-19 Oracle America, Inc. Method and apparatus for balancing project shares within job assignment and scheduling
US8010672B2 (en) * 2005-07-29 2011-08-30 Alcatel Lucent Methods and systems for controlling utilization of resources of contention
GB0519597D0 (en) * 2005-09-26 2005-11-02 Imagination Tech Ltd Scalable multi-threaded media processing architecture
GB0519981D0 (en) 2005-09-30 2005-11-09 Ignios Ltd Scheduling in a multicore architecture
US20070143759A1 (en) 2005-12-15 2007-06-21 Aysel Ozgur Scheduling and partitioning tasks via architecture-aware feedback information
US8185909B2 (en) * 2007-03-06 2012-05-22 Sap Ag Predictive database resource utilization and load balancing using neural network model
US8261282B1 (en) * 2008-09-30 2012-09-04 Netapp, Inc. System and method for virtual machine host load protection

Patent Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20050149940A1 (en) * 2003-12-31 2005-07-07 Sychron Inc. System Providing Methodology for Policy-Based Resource Allocation
WO2005078580A1 (fr) * 2004-02-06 2005-08-25 Intel Corporation Procede de reduction de la consommation d'energie d'applications tamponnees a l'aide de processeur multitache simultane

Non-Patent Citations (2)

* Cited by examiner, † Cited by third party
Title
CORBALAN J ET AL: "Performance-Driven Processor Allocation", IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, IEEE SERVICE CENTER, LOS ALAMITOS, CA, US, vol. 16, no. 7, 1 July 2005 (2005-07-01), pages 599 - 611, XP011133204, ISSN: 1045-9219 *
GERARD BOSCH I CREUS ET AL: "System-Level Power Management for Mobile Devices", COMPUTER AND INFORMATION TECHNOLOGY, 2007. CIT 2007. 7TH IEEE INTERNATIONAL CONFERENCE ON, IEEE, PISCATAWAY, NJ, USA, 16 October 2007 (2007-10-16), pages 799 - 804, XP031220920, ISBN: 978-0-7695-2983-7 *

Also Published As

Publication number Publication date
US20110214129A1 (en) 2011-09-01
US8752061B2 (en) 2014-06-10

Similar Documents

Publication Publication Date Title
US8752061B2 (en) Resource allocation within multiple resource providers based on the incoming resource request and the expected state transition of the resource requesting application, and selecting a resource provider based on the sum of the percentage of the resource provider currently used, the requesting load as a percentage of the resource provider's total resource, and the additional load imposed by the expected state of the requesting application as a percentage of the resource provider's total resource
US20080320483A1 (en) Resource management system and method
US7207040B2 (en) Multi-CPUs support with thread priority control
WO2009098547A1 (fr) Gestion de mémoire
CN111223036B (zh) 一种gpu虚拟化共享方法、装置及电子设备和存储介质
CA2288459C (fr) Systeme de remise dans un procede d'encheres base sur la qualite du service
CN111542809A (zh) 管理虚拟网络功能
US7533383B2 (en) Method, system, and apparatus for scheduling pattern based web services
CN111258565A (zh) 小程序的生成方法、系统、服务器及存储介质
EP2224381A1 (fr) Procédé et appareil pour composition de service basé sur des cas
CN110673787A (zh) 一种配置卷的方法及装置
CN111885184A (zh) 高并发场景下热点访问关键字处理方法和装置
CN116775764A (zh) 分布式id生成方法、分布式id生成装置及存储介质
CN114710483B (zh) 一种基于多云对象存储的统一传输方法及系统
CN112583732B (zh) 基于控制粒度池对接口调用的流量控制方法及相关设备
KR101266685B1 (ko) 폴리시 이네이블 프로그래밍을 위한 방법 및 시스템
CN114968422A (zh) 基于变量状态自动执行合约的方法和装置
CN111221651B (zh) 负载均衡配置方法、装置、服务器及可读存储介质
CN113626001A (zh) 一种基于脚本的api动态编排方法及装置
CN113821157A (zh) 一种本地磁盘挂载方法、装置、设备及存储介质
CN115543647A (zh) 一种函数调用方法
CN110865876A (zh) 一种服务依赖资源的调度方法及装置
CN111737964A (zh) 表格动态处理方法、设备及介质
CN111861292A (zh) 运单号生成方法、装置、服务器和存储介质
CN108363614A (zh) 一种应用的业务模块管理方法、装置及服务器

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 08875863

Country of ref document: EP

Kind code of ref document: A1

WWE Wipo information: entry into national phase

Ref document number: 13128025

Country of ref document: US

NENP Non-entry into the national phase

Ref country code: DE

122 Ep: pct application non-entry in european phase

Ref document number: 08875863

Country of ref document: EP

Kind code of ref document: A1