Static Allocation Algorithm Research Articles

Impact of condition number on total sum rate for NOMA systems

In the fifth-generation mobile communications networks, several resource allocation techniques have been used, such as static allocation and dynamic algorithms (greedy or matching theory); this work proposes a new subcarrier allocation scheme based on the evaluation of the instantaneous behaviour of the wireless channel using the condition number of the channel matrix H . Simulation results reveal that the proposed scheme increases the total sum rate of the system, compared to their predecessors.

Techniques for Allocation of Sensors in Shared Wireless Sensor Networks

Wireless sensor networks (WSNs) hosting multiple applications are gaining popularity over wireless sensor networks dedicated to a single application. The applications hosted by the WSN may have different characteristics. This research investigates the importance of using information about the characteristics of the applications and the state of the network while allocating the sensor nodes to requests for applications. A number of static and dynamic allocation algorithms are investigated. Results of simulation experiments demonstrate that the lifetime of a WSN can be effectively increased by using information about the applications and the state of the WSN. Insights into the relationship between system performance and various system and workload characteristics gained from the simulation experiments are presented.

Research on Bandwidth Allocation of Multimedia Communication System Based on Internet of Things

In Internet of Things applications rapidly globalizing trends, especially the applications based on multimedia, traditional static bandwidth allocation method or dynamic bandwidth allocation algorithm based on business segments has been difficult to adapt to the new situation, in order to ensure the transmission performance, a new bandwidth allocation scheme is proposed which is based on RBF neural network . Simulation results show that the new scheme can effectively improve system stability, improve the utilization of system bandwidth resources.

A MP2MP-DBA Algorithm in Home Network Based on 60GHz Millimeter-Wave Communication

A novel multipoint-to-multipoint bandwidth allocation algorithm named MP2MP-DBA based on 60GHz millimeter-wave communication is proposed for home network. Simulation results show that the MP2MP-DBA achieves better throughput and delay than static bandwidth allocation algorithm.

Memory Optimization on Heterogeneous Multiprocessor Embedded Systems for DSP Applications

Embedded systems are widely used in the implementation of DSP applications. The implementation of such a system can be entirely accomplished on a single ASIC chip. An ASIC implementing a complicated DSP task is normally composed of a set of heterogeneous processing elements, an interconnection network, and memory elements. Because the type and size of the memory used have a great effect on the cost and complexity of the entire system, a memory allocation process should be optimized to reduce the memory complexity. This paper proposes a static memory allocation algorithm for synchronous heterogeneous multiprocessor integrated systems, implementing DSP applications. This allocation algorithm is designed to minimize the memory size, or alternatively, the number of registers. The proposed register allocation algorithm is shown to outperform other algorithms on all the tested benchmarks. Furthermore, two types of memory systems are introduced: central shared memory and distributed shared memory systems. The advantages and disadvantages of each memory system are also given.

Competitive analysis of caching in distributed databases

This paper makes two contributions. First, we introduce a model for evaluating the performance of data allocation and replication algorithms in distributed databases. The model is comprehensive in the sense that it accounts for I/O cost, for communication cost, and, because of reliability considerations, for limits on the minimum number of copies of the object. The model captures existing replica-management algorithms, such as read-one-write-all, quorum-consensus, etc. These algorithms are static in the sense that, in the absence of failures, the copies of each object are allocated to a fixed set of processors. In modern distributed databases, particularly in mobile computing environments, processors will dynamically store objects in their local database and will relinquish them. Therefore, as a second contribution of this paper, we introduce an algorithm for automatic dynamic allocation of replicas to processors. Then, using the new model, we compare the performance of the traditional read-one-write-all static allocation algorithm to the performance of the dynamic allocation algorithm. As a result, we obtain the relationship between the communication cost and I/O cost for which static allocation is superior to dynamic allocation, and the relationships for which dynamic allocation is superior.

Development, Analysis, and Verification of a Parallel Hybrid Dataflow Computer Architectural Framework and Associated Load-Balancing Strategies and Algorithms via Parallel Simulation

This paper first presents the requirements for and the architectural framework of a type of real-time parallel dataflow computer architecture, specifically, a Hybrid Data/Command Driven Architecture (HDCA). Application of such an architecture is discussed. Goals, strategies, and algorithms for both static load-balancing and dynamic resource allocation on an HDCA system are presented. A parallel simulation of an HDCA system employing the presented static load-balancing and dynamic resource allocation algorithms is developed and presented. The parallel simulation was executed on a parallel computer system for increased fidelity. Analysis of simulation results for two example applications of the architecture allowed verification of design goals and correct performance of the HDCA architectural framework and associated static load-balancing and dynamic resource allocation strategies and algorithms.

Allocation of Periodic Hard Real-Time Tasks

In this paper, a static allocation (mapping) algorithm is described which handles periodic, hard real-time controller tasks. Our hybrid approach combines the advantages of constructive, and non-guided-search methods to overcome the problems of purely constructive, or purely non-guided-search techniques.The new method is motivated by the configuration of a parallel real-time operating system to manage very complex control applications. The goal of the configuration is to reduce OS overhead as much as possible. It is achieved by allocating the controller tasks to the processor network in advance. Following this approach the advantages of special purpose processors (no overhead) and OS driven computers (good utilisation) are combined.

A Comparison of Dynamic and Static Virtual Memory Allocation Algorithms

In this paper we compare the performance of virtual memory allocation algorithms. The primary measure of performance is the space-time product of primary memory occupancy, or space-time cost, used by a program during its execution. Using DMIN, an optimal dynamic aliocation algorithm, we compute the minimum space-time cost achievable for some benchmark program runs. We compare the DMIN space-time cost with the space-time cost from: MIN, an optimal static allocation algorithm, VMIN, an optimal variable space algorithm, and two heuristic dynamic allocation algorithms. the page fault frequency algorithm and the damped working set algorithm.

On Static Memory Allocation in Computer Systems

An algorithm for allocation of memory resources is presented making use of a priori information about a computer program. This static allocation algorithm is based on a directed graph model of computations with particular attention to the memory allocation of programs assigned for execution on multiprocessor systems.