The connection oriented flow control method is subject to a high retry rate with the heavy network load. An asynchronous link induces an extra latency when its bandwidth is directly enlarged by increasing the wire count. In this paper, a new dynamic link allocation flow control method is proposed. By dynamically allocating the sub-links on a link to multiple frames, it decreases the retry rate ...

Dynamic memory allocator has been an essential component in computer software for decades, which evolves to be sophisticated to meet both the strict performance and space requirements. This paper studies the design of simplified versions of two popular dynamic memory allocators, namely, the dlmalloc used in GNU libc and the tcmalloc used in Google Chrome browser. In this paper, we also conduct ...

With the rapid growth of wireless access networks, various providers offer their services using different technologies such as Wi-Fi, Wimax, 3G, 4G and so on. These networks compete for the scarce wireless spectrum. The spectrum is considered to be a scarce resource moderated by the spectrum allocation regulatory (“regulatory” for short) which is the governance body aiming to maximize the socia...

The resources of logistics are different at anytime and anywhere, so how to integrate these resources has become the key issue of logistics scheduling. In view of the advantages of the Internet, especially the advantages of the mobile Internet, the dynamic allocation of resources has become the key issue of logistics allocation. Based on the characteristics of logistics allocation by Markov ran...

Full terms and conditions of use: http://pubsonline.informs.org/page/terms-and-conditions This article may be used only for the purposes of research, teaching, and/or private study. Commercial use or systematic downloading (by robots or other automatic processes) is prohibited without explicit Publisher approval, unless otherwise noted. For more information, contact [email protected]. The...

We explore a dynamic approach to the problems of call admission and resource allocation for communication networks with connections that are differentiated by their quality of service requirements. In a dynamic approach, the amount of spare resources is estimated on-line based on feedbacks from the network's quality of service monitoring mechanism. The schemes we propose remove the dependence o...

dvances in information technology such as object-oriented programming, realtime operating systems, and reliable computer communication networks enable the deployment of effective control and automation systems [1]. Industry exploits information technology in distributed control system (DCS) products, whose components include proportional-integral-derivative (PID) and programmable logic controll...

This paper presents a model that is useful for developing resource allocation algorithms for distributed real-time systems that operate in dynamic environments. Interesting aspects of the model include dynamic environments, utility and service levels, which provide a means for graceful degradation in resourceconstrained situations and support optimization of the allocation of resources. The pap...

Current worst-case execution time (WCET) analyses do not support programs using dynamic memory allocation. This is mainly due to the unpredictable cache performance when standard memory allocators are used. We present algorithms to compute a static allocation for programs using dynamic memory allocation. Our algorithms strive to produce static allocations that lead to minimal WCET times in a su...

Comparison of static and dynamic control allocation techniques for nonlinear constrained optimal distribution of tire forces in a vehicle control system is presented. The total body forces and moments, obtained from a high level controller, are distributed among tire forces, which are constrained to nonlinear constraint of saturation, through two approaches. For the static control allocation te...