Portable computing devices (PDs) are ubiquitous. These devices may include cellular telephones, portable digital assistants (PDAs), portable game consoles, palmtop computers, and other portable electronic devices. In addition to the primary function of these devices, many include peripheral functions. For example, a cellular telephone may include the primary function of making cellular telephone calls and the peripheral functions of a still camera, a video camera, global positioning system (GPS) navigation, web browsing, sending and receiving emails, sending and receiving text messages, push-to-talk capabilities, etc. As the functionality of such a device increases, the computing or processing power required to support such functionality also increases. Further, as the computing power increases, there exists a greater need to effectively manage the processor, or processors, that provide the computing power.
Accordingly, what is needed is an improved method of sampling data within a central processing unit.
In the figures, like reference numerals refer to like parts throughout the various views unless otherwise indicated.
The word “exemplary” is used herein to mean “serving as an example, instance, or illustration.” Any aspect described herein as “exemplary” is not necessarily to be construed as preferred or advantageous over other aspects.
In this description, the term “application” may also include files having executable content, such as: object code, scripts, byte code, markup language files, and patches. In addition, an “application” referred to herein, may also include files that are not executable in nature, such as documents that may need to be opened or other data files that need to be accessed.
The term “content” may also include files having executable content, such as: object code, scripts, byte code, markup language files, and patches. In addition, “content” referred to herein, may also include files that are not executable in nature, such as documents that may need to be opened or other data files that need to be accessed.
As used in this description, the terms “component,” “database,” “module,” “system,” and the like are intended to refer to a computer-related entity, either hardware, firmware, a combination of hardware and software, software, or software in execution. For example, a component may be, but is not limited to being, a process running on a processor, a processor, an object, an executable, a thread of execution, a program, and/or a computer. By way of illustration, both an application running on a computing device and the computing device may be a component. One or more components may reside within a process and/or thread of execution, and a component may be localized on one computer and/or distributed between two or more computers. In addition, these components may execute from various computer readable media having various data structures stored thereon. The components may communicate by way of local and/or remote processes such as in accordance with a signal having one or more data packets (e.g., data from one component interacting with another component in a local system, distributed system, and/or across a network such as the Internet with other systems by way of the signal).
Referring initially to
In a particular aspect, as depicted in
Referring to
As illustrated in
As further illustrated in
As depicted in
In a particular aspect, one or more of the method steps described herein may be stored in the memory 344 as computer program instructions. These instructions may be executed by the multicore CPU 324 in order to perform the methods described herein. Further, the multicore CPU 324, the memory 344, or a combination thereof may serve as a means for executing one or more of the method steps described herein in order to sample data within a central processing unit.
Referring to
Moreover, as illustrated, the memory 404 may include an operating system 420 stored thereon. The operating system 420 may include a scheduler 422 and the scheduler 422 may include a first run queue 424, a second run queue 426, and an Nth run queue 428. The memory 404 may also include a first application 430, a second application 432, and an Nth application 434 stored thereon.
In a particular aspect, the applications 430, 432, 434 may send one or more tasks 436 to the operating system 420 to be processed at the cores 410, 412, 414 within the multicore CPU 402. The tasks 436 may be processed, or executed, as single tasks, threads, or a combination thereof. Further, the scheduler 422 may schedule the tasks, threads, or a combination thereof for execution within the multicore CPU 402. Additionally, the scheduler 422 may place the tasks, threads, or a combination thereof in the run queues 424, 426, 428. The cores 410, 412, 414 may retrieve the tasks, threads, or a combination thereof from the run queues 424, 426, 428 as instructed, e.g., by the operating system 420 for processing, or execution, of those task and threads at the cores 410, 412, 414.
In a particular aspect, the controller 440 may be a software program. However, in an alternative aspect, the controller 440 may be a hardware controller that is external to the memory 404. In either case, the controller 440, the memory 404, the cores 410, 412, 414, or any combination thereof may serve as a means for executing one or more of the method steps described herein in order to sample data from the cores 410, 412, 414.
Referring to
Moving to decision 506, the controller may determine whether the CPU, or a core of the CPU, has entered an idle state. If so, the method may proceed to block 508 and the controller may execute a DCVS algorithm. Thereafter, at decision 510, the controller may determine whether the CPU, or the core of the CPU, as exited the idle state. If not, the method 500 may proceed to block 511 and the CPU may remain idle. Then, the method may return to decision 510 and the method 500 may continue as described herein. Otherwise, if the CPU, or the core of the CPU, exits the idle state, the method 500 may continue to block 512 and the controller may cease the execution of the DCVS algorithm. Thereafter, the controller may determine whether the device is powered off. If the device is powered off, the method 500 may end. Conversely, if the device remains powered on, the method 500 may return to block 504 and the method 500 may continue as described herein.
Returning to decision 506, if the CPU, or the core of the CPU, does not enter an idle state, the method 500 may proceed to decision 516. At decision 516, the controller may determine whether a timer has fired. If not, the method 500 may return to block 504 and the method 500 may continue as described herein. If the timer is fired, the method 500 may move to block 518 and the controller may increase the CPU frequency one step. Next, at decision 520, the controller may determine whether the CPU frequency is at a maximum CPU frequency. If the CPU frequency is at a maximum CPU frequency, the timer may be cancelled at block 522. Then, the method 500 may proceed to decision 514 and the method 500 may continue as described herein. If the CPU frequency is not at the maximum CPU frequency, the method 500 may move directly to decision 514 and the method 500 may continue as described herein.
In a particular aspect, execution of the DCVS algorithm may be skipped if idle is entered to substantially close to the previous idle time. This may be dependent on a desired DCVS response time.
Referring to
Moving to block 606, the controller may monitor CPU activity. This activity may be the activity of a single core CPU, a multi-core CPU, multiple single core CPUs, multiple multi-core CPUs, or a combination thereof. Further, the controller may be a software controller, a hardware controller, or a combination thereof.
Moving to decision 608, the controller may determine whether the CPU, or a core of the CPU, has entered an idle state. If the CPU does not enter an idle state, the method 600 may proceed directly to decision 802 of
At block 702, of
Returning to decision 608 of
At decision 802 of
Next, at decision 808, the controller may determine whether the CPU frequency is at a maximum CPU frequency. If the CPU frequency is at a maximum CPU frequency, the timer may be cancelled at block 810. Then, the method 600 may return to block 606 of
Returning to decision 804, if the controller is operating in a quality of service mode (QoS), the method 600 may proceed to block 812 and the controller may increase the CPU frequency to the maximum CPU frequency. Then, the method 600 may then return to block 712 of
At t2, the CPU may enter an idle state again. The time may be noted, i.e., the CPU was busy from t1 to t2, or for (t2-t1). Then, the timer may be canceled. At t3 the CPU may exit the idle state. The time may be noted, i.e., the CPU was idle from t2 to t3, or for (t3-t2). Next, the timer may be set for t3 plus 90 ms. At t3 plus 90 ms, the timer fires and the CPU frequency is increased. If the CPU is in a normal mode, the CPU frequency may increase one incremental frequency step. If the CPU is in a QoS condition, the CPU frequency may increase to a maximum CPU frequency. Further, if the CPU frequency is not at the maximum CPU frequency, the timer may be rescheduled for (t3 plus 90 ms) plus 90 ms, i.e., 90 ms from the current time. At t4, the CPU, once again, enters an idle state. The time may be noted, i.e., the CPU was busy from t3 to t4, or for (t4-t3), and at a higher rate from (t3+90 ms) to t4. Then, the timer may be canceled.
In a particular aspect, with all the data points collected above, the DCVS algorithm has access to the exact CPU idle times and CPU usage without any interruption of normal processing except for the case at t3 plus 90 ms, and that interruption does minimal work because the decision has been pre-computed at idle time. The DCVS algorithm may also have access to the history of idle/work distribution.
It is to be understood that the method steps described herein need not necessarily be performed in the order as described. Further, words such as “thereafter,” “then,” “next,” etc. are not intended to limit the order of the steps. These words are simply used to guide the reader through the description of the method steps. Moreover, the methods described herein are described as executable on a portable computing device (PCD). The PCD may be a mobile telephone device, a portable digital assistant device, a smartbook computing device, a netbook computing device, a laptop computing device, a desktop computing device, or a combination thereof.
The system and methods described herein provide a sampling method that may be sample-rate independent. Moreover, responsivity, quality of service (QoS), or a combination thereof may be first-class input parameters. Further, the DCVS algorithm processing doesn't interrupt real work and the overhead may move to zero when system is fully loaded. Additionally, clock changes may piggyback on exiting power collapse.
In a particular aspect, with the configuration described herein, the sampling of data may be considered opportunistic. This opportunistic sampling method does not sample the CPU load/idle time at fixed intervals. Instead the opportunistic sampling method directly measures CPU idle by noting when the CPU enters and leaves the idle state. This eliminates the interrupt/context switch overhead associated with periodic sampling. The DCVS algorithm may then runs at idle time when the system is otherwise quiescent, which means that the DCVS algorithm does not interfere with any useful work, and the DCVS algorithm overhead is independent of desired DCVS responsivity.
In general, the present method may save an interrupt and two (2) context switches per sample. Additionally, this may allow CPU clock frequency changes to be scheduled around exiting idle when there is often a clock change necessary.
In a particular aspect, if the CPU were to become fully subscribed, i.e., become one hundred percent (100%), there would be no idle time. With no idle time, there is no opportunity for a sample to be taken and for the DCVS algorithm to run. To avoid this starvation issue, a timeout callback is registered at the worst case busy time for the DCVS algorithm. If the CPU does not go idle before that timeout expires, the system may change clock frequency. This timeout provides a bound on performance even in the presence of a DCVS algorithm. The clock frequency change could include a normal increase in clock frequency or a larger change (up to maximum) to provide any QoS guarantee that maybe required.
In either case, the overhead is minimized, because in this fully subscribed condition there is no need to sample idle data or run the DCVS algorithm, i.e., the decision logic is pre-computed. Once the CPU reaches max frequency, the timeout can be cancelled as the system is in the terminal state. Because of this, the present system and method may scale well under load. If the system gets highly loaded, the DCVS algorithm overhead will go to zero. This property may be independent of any desired DCVS responsivity/sensitivity. Further, the present system and method supports arbitrary DCVS algorithms.
In one or more exemplary aspects, the functions described may be implemented in hardware, software, firmware, or any combination thereof. If implemented in software, the functions may be stored on or transmitted over as one or more instructions or code on a computer program product such as a machine readable medium, i.e., a computer-readable medium. Computer-readable media includes both computer storage media and communication media including any medium that facilitates transfer of a computer program from one place to another. A storage media may be any available media that may be accessed by a computer. By way of example, and not limitation, such computer-readable media may comprise RAM, ROM, EEPROM, CD-ROM or other optical disk storage, magnetic disk storage or other magnetic storage devices, or any other medium that may be used to carry or store desired program code in the form of instructions or data structures and that may be accessed by a computer. Also, any connection is properly termed a computer-readable medium. For example, if the software is transmitted from a website, server, or other remote source using a coaxial cable, fiber optic cable, twisted pair, digital subscriber line (DSL), or wireless technologies such as infrared, radio, and microwave, then the coaxial cable, fiber optic cable, twisted pair, DSL, or wireless technologies such as infrared, radio, and microwave are included in the definition of medium. Disk and disc, as used herein, includes compact disc (CD), laser disc, optical disc, digital versatile disc (DVD), floppy disk and blu-ray disc where disks usually reproduce data magnetically, while discs reproduce data optically with lasers. Combinations of the above should also be included within the scope of computer-readable media.
Although selected aspects have been illustrated and described in detail, it will be understood that various substitutions and alterations may be made therein without departing from the spirit and scope of the present invention, as defined by the following claims.
The present application claims priority to U.S. Provisional Patent Application Ser. No. 61/294,028, entitled SYSTEM AND METHOD OF SAMPLING DATA WITHIN A CENTRAL PROCESSING UNIT, filed on Jan. 11, 2010, the contents of which are fully incorporated by reference.
Number | Date | Country | |
---|---|---|---|
61294028 | Jan 2010 | US |