Dynamic storage allocation has a signi cant impact on computer performance. A dynamic storage allocator manages space for objects whose lifetimes are not known by the system at the time of their creation. A good dynamic storage allocator should utilize storage e ciently and satisfy requests in as few instructions as possible. A dynamic storage allocator on a multiprocessor should have the abili...

A major investment decision for individual and institutional investors alike is to choose between different asset classes, i.e., equity investments and interest-bearing investments. The asset allocation decision determines the ultimate risk and return of a portfolio. The asset allocation problem is frequently addressed either through a static analysis, based on Markowitz’ mean-variance model, o...

This paper provides network designers and operators with simple guidelines on traffic measurements and efficiency evaluation of various channel allocation schemes in digital mobile telecommunications networks. The paper evaluates the efficiency obtained by implementing the following channel allocation schemes: 1) fixed uniform channel allocation (FUCA); 2) fixed nonuniform channel allocation (F...

To achieve the requirement of high data rate, low latency, user fairness for next generation wireless networks, proper designing of cross-layer optimized dynamic resource allocation algorithm is prerequisite. In this paper, we propose a dynamic resource allocation scheme in Orthogonal Frequency Division Multiple Access (OFDMA) systems to optimize the non real-time (NRT) traffic, which requires ...

Recently fair division theory has emerged as a promising approach for the allocation of multiple computational resources among agents. While in reality agents are not all present in the system simultaneously, previous work has studied static settings where all relevant information is known upfront. Our goal is to better understand the dynamic setting. On the conceptual level, we develop a dynam...

In this paper, we present three parallel approximate string matching methods on a parallel architecture with heterogeneous workstations to gain supercomputer power at low cost. The first method is the static master-worker with uniform distribution strategy, the second one is the dynamic master-worker with allocation of subtexts and the third one is the dynamic master-worker with allocation of t...

In this paper we study the scalability issue in the design of a centralized bandwidth broker model for dynamic control and management of QoS provisioning. We propose and develop a path-oriented, quota-based dynamic bandwidth allocation mechanism for efficient admission control operations under the centralized bandwidth broker model. We demonstrate that this dynamic bandwidth allocation mechanis...

Mission-critical, distributed systems are often designed as a set of distributed, components that interact using publish/subscribe middleware. Currently, in these systems, software components are usually statically allocated to the nodes to fulfil predictability, reliability requirements. However, a static allocation of components has major drawbacks, e.g. the need for quantification of the exp...

In this paper we study the scalability issue in the design of a centralized bandwidth broker model for dynamic control and management of QoS provisioning. We propose and develop a path-oriented, quota-based dynamic bandwidth allocation mechanism for efficient admission control operations under the centralized bandwidth broker model. We demonstrate that this dynamic bandwidth allocation mechanis...