In this paper, we propose an extension to the personal communication services (PCS) location management protocol which uses dynamically overlapped registration areas. The scheme is based on monitoring the aggregate mo...
详细信息
In this paper, we propose an extension to the personal communication services (PCS) location management protocol which uses dynamically overlapped registration areas. The scheme is based on monitoring the aggregate mobility and call pattern of the users during each reconfiguration period and adapting to the mobility and call patterns by either expanding or shrinking registration areas at the end of each reconfiguration period. We analytically characterize the trade-off resulting from the inclusion or exclusion of a cell in a registration area in terms of expected change in aggregate database access cost and signaling overhead. This characterization is used to guide the registration area adaption in a manner in which the signaling and database access load on any given location register (LR) does not exceed a specified limit. Our simulation results show that it is useful to dynamically adapt the registration areas to the aggregate mobility and call patterns of the mobile units when the mobility pattern exhibits locality. For such mobility and call patterns, the proposed scheme can greatly reduce the average signaling and database access load on LRs. Further, the cost of adapting the registration areas is shown to be low in terms of memory and communication requirements.
Defining tasks as independent entities with identical execution time and the workload of a processor as the number of tasks, loadbalancing is to distribute tasks among processors of a network so that the resulting wo...
详细信息
Defining tasks as independent entities with identical execution time and the workload of a processor as the number of tasks, loadbalancing is to distribute tasks among processors of a network so that the resulting workload of every processor will be as close to the average over all the workloads as possible. We propose in this paper a partially asynchronous and iterative algorithm for distributed load balancing, show its properties, and report its simulation results. The algorithm converges geometrically as assured by a theorem for balancing continuous workload. We prove that the algorithm can achieve the maximum load imbalance of no more than [d/2] tasks, where d is the diameter of a network. Our simulation not only validated the properties but also showed that the algorithm could produce much smaller load imbalances for hypercubes. The obtained imbalances for hypercubes of order up to ten were no more than two tasks and 56% of the sample runs produced only one task difference, as opposed to the theoretical maximum of six tasks.
We present distributed load balancing mechanisms implemented on multiprocessor systems for real time video encoding, which dynamically equalize load amounts among PE's to cope with extensive computing requirements...
详细信息
We present distributed load balancing mechanisms implemented on multiprocessor systems for real time video encoding, which dynamically equalize load amounts among PE's to cope with extensive computing requirements. The loosely coupled multiprocessor system, e.g. a torus connected one, is treated as the objective system. Two decentralized controlled loadbalancing algorithms are proposed, and mathematical analyses are provided to obtain some insights of our decentralized controlled mechanisms. We also prove the proposed algorithms are steady and effective theoretically and experimentally.
We study the effectiveness of different parallel architectures for achieving the high throughputs and low latencies needed in processing signaling protocols for high speed networks. A key performance issue is the trad...
详细信息
We study the effectiveness of different parallel architectures for achieving the high throughputs and low latencies needed in processing signaling protocols for high speed networks. A key performance issue is the trade off between the loadbalancing gains and the call record management overhead. Arranging processors in large groups potentially yields higher loadbalancing gains but also incurs higher overhead in maintaining consistency among the replicated copies of the cad records. We study this tradeoff and its impact on the design of protocol processing systems for two generic classes of parallel architectnres, namely, shared memory and distributed memory architectures. In shared memory architectures, maintaining a common message queue in the shared memory can provide the maximal loadbalancing gains. We show, however, in order to optimize performance it is necessary to organize the processors in small groups since large groups result in higher cad record management overhead In distributed memory architectures with each processor maintaining its own message queue there is no inherent provision for loadbalancing, Based on a detailed simulation analysis we show that organizing the processors into small groups end using a simple distributed load balancing scheme yields modest performance gains even after cap record management overheads are taken into account, We find that the common message queue architecture outperforms the distributed architecture in terms of lower response time due to its improved loadbalancing capability, Finally, we do a fault-tolerance analysis with respect to the call-record data structure, Using a simple failure recovery model of the processors and the local memory, we show that in the case of shared memory architecture, the availability is also optimized when processors are organized in small groups, This is because when comparing architectures the higher cap record management overhead incurred for larger group sizes must be accounted for
暂无评论