Abstract: A start time to begin transitioning resources to states indicated in the second resource state set is scheduled based upon an estimated amount of processing time to complete transitioning the resources. At a scheduled start time, a process starts in which the states of one or more resources are switched from states indicated by the first resource state set to states indicated by the second resource state set. Scheduling the process of transitioning resource states to begin at a time that allows the process to be completed just in time for the resource states to be immediately available to the processor upon entering the second application state helps minimize adverse effects of resource latency. This calculation for the time that the process should be completed just in time may be enhanced when system states and transitions between states are measured accurately and stored in memory of the portable computing device.

Abstract: A start time to begin transitioning resources to states indicated in the second resource state set is scheduled based upon an estimated amount of processing time to complete transitioning the resources. At a scheduled start time, a process starts in which the states of one or more resources are switched from states indicated by the first resource state set to states indicated by the second resource state set. Scheduling the process of transitioning resource states to begin at a time that allows the process to be completed just in time for the resource states to be immediately available to the processor upon entering the second application state helps minimize adverse effects of resource latency. This calculation for the time that the process should be completed just in time may be enhanced when system states and transitions between states are measured accurately and stored in memory of the portable computing device.

Abstract: A start time to begin transitioning resources to states indicated in the second resource state set is scheduled based upon an estimated amount of processing time to complete transitioning the resources. At a scheduled start time, a process starts in which the states of one or more resources are switched from states indicated by the first resource state set to states indicated by the second resource state set. Scheduling the process of transitioning resource states to begin at a time that allows the process to be completed just in time for the resource states to be immediately available to the processor upon entering the second application state helps minimize adverse effects of resource latency. This calculation for the time that the process should be completed just in time may be enhanced when system states and transitions between states are measured accurately and stored in memory of the portable computing device.

Abstract: A method and system for dynamically creating and servicing master-slave pairs within and across switch fabrics of a portable computing device (“PCD”) are described. The system and method includes receiving a client request comprising a master-slave pair and conducting a search for a slave corresponding to the master-slave pair. A route for communications within and across switch fabrics is created and that corresponds to the master-slave pair. One or more handles or arrays may be stored in a memory device that correspond to the created route. Next, bandwidth across the route may be set. After the bandwidth across the newly created route is set, the client request originating the master-slave pair may be serviced using the created route. Conducting the search for the slave may include comparing unique identifiers assigned to each slave in a master-slave hierarchy.

Abstract: A start time to begin transitioning resources to states indicated in the second resource state set is scheduled based upon an estimated amount of processing time to complete transitioning the resources. At a scheduled start time, a process starts in which the states of one or more resources are switched from states indicated by the first resource state set to states indicated by the second resource state set. Scheduling the process of transitioning resource states to begin at a time that allows the process to be completed just in time for the resource states to be immediately available to the processor upon entering the second application state helps minimize adverse effects of resource latency. This calculation for the time that the process should be completed just in time may be enhanced when system states and transitions between states are measured accurately and stored in memory of the portable computing device.

Abstract: A method and system for dynamically creating and servicing master-slave pairs within and across switch fabrics of a portable computing device (“PCD”) are described. The system and method includes receiving a client request comprising a master-slave pair and conducting a search for a slave corresponding to the master-slave pair. A route for communications within and across switch fabrics is created and that corresponds to the master-slave pair. One or more handles or arrays may be stored in a memory device that correspond to the created route. Next, bandwidth across the route may be set. After the bandwidth across the newly created route is set, the client request originating the master-slave pair may be serviced using the created route. Conducting the search for the slave may include comparing unique identifiers assigned to each slave in a master-slave hierarchy.