Home
GRANT ALLOCATIONS
|
|
| Brand | Owner (click to sort) |
|---|---|
| A PEW RESEARCH CENTER PROJECT | The Pew Research Center |
| PEW RESEARCH CENTER | The Pew Research Center |
Technical Examples
- Methods and apparatus are disclosed for scheduling packets, such as in systems having a non-blocking switching fabric and homogeneous or heterogeneous line card interfaces. In one implementation, multiple request generators, grant arbiters, and acceptance arbiters work in conjunction to determine this scheduling. A set of requests for sending packets from a particular input is generated. From a grant starting position, a first n requests in a predetermined sequence are identified, where n is less than or equal to the maximum number of connections that can be used in a single packet time to the particular output. The grant starting position is updated in response to the first n grants including a particular grant corresponding to a grant advancement position. In one embodiment, the set of grants generated based on the set of requests is similarly determined using an acceptance starting position and an acceptance advancement position.
- A multi-channel serial advanced technology attachment (SATA) control system and control card thereof includes a first SATA control module, a first access-grant arbitration unit, a second SATA control module, a second access-grant arbitration unit and a path selection module. Through an arbitration process performed in the first and second access-grant arbitration units, an access-grant is determined. And a selection signal is generated based on the process result that is sent to the path selection module, to switch a transmission path to the SATA control module which has acquired the access-grant. Therefore, multi-channel SATA data access function may be achieved.
- The invention provides methods of, and systems for, optimizing the allocation of inventory to, and pricing of, goods sold by multiple retail sites, e.g., in a store, chain or other retail enterprise. Such a method includes generating a plurality of possible or "candidate" allocations of a given inventory among the multiple retail sites. That inventory can be, for example, a supply of the same or like goods at a distribution center that serves the retail sites. Each candidate allocation comprises an assignment of a respective share of that inventory to each of the sites. For each of the candidate allocations, an optimal price of the goods at each of the retail sites is estimated. The optimal price is one that will return an optimal gross margin to the respective site, given its assignment of the respective share of the inventory for the particular candidate allocation. For each of the candidate allocations, a sum is determined of the optimal gross margins across all the retail sites. From substantially all possible allocations, the candidate allocation that results in a largest total optimal gross margin is efficiently chosen.
- Methods and systems for allocating address space resources to resource requesting peripheral devices in an efficient manner. Resource request are gathered for enumerated peripheral devices host by a computer platform. A map containing resource alignment requirements is built, and a virtual resource allocation map is computed based on aggregated resource requests and the alignment requirements. The resource aggregations are, in turn, based on a hierarchy of the peripheral devices. A bin-packing algorithm is employed to determine allocation of the resource requests so as to minimize resource address space allocations. The virtual resource map is then used to perform actual resource allocations. The resources include peripheral device I/O address allocation and peripheral device memory address allocations.
- In a communication system comprising a network unit and a plurality of subscriber units connected to the network unit, the network unit generates a message in which validity of transmission grant information is set for the subscriber units, and suspends a transmission of polling information to allocate a transmission grant to the subscriber units by using the transmission grant information for a fixed time in consideration of a processing time of the subscriber units from a time when the message has been completely transmitted. Also, when a disconnection state of an inputted cell from the subscriber units is detected, the network unit may suspend an input disconnection detecting operation for a fixed time from a time when the message and the polling information have been completely transmitted. Furthermore, a switchover of an input disconnection detection/transmission grant information may be suspended by mutually exchanging messages.
Thank you for using Findownersearch.com. If you have any comments or suggestions, please contact us.