Flexible Resource Allocation Using Photonic Switched Interconnects for Disaggregated System Architectures

OpenMP is one of the most popular programming models in the field of parallel computing, which is widely used in multi-threaded programming with shared memory. But with the continuous change of program computing scale, the problem of resource supply has become increasingly prominent. Making use of the cloud computing to dynamically provide resources for OpenMP program is a meaningful work. Based on the internal structure characteristics of OpenMP program, a flexible elastic resource allocation strategy is designed, and a load prediction method combining active and reactive prediction based on machine learning is proposed to realize the load prediction of OpenMP program. Then, the fuzzy controller is used to coordinate the resources and infer the CPU and memory resources needed by the program in the next cycle. On this basis, the middleware OPEC is designed and implemented to realize the dynamic allocation of cloud resources during the operation of OpenMP program. Parsec, a benchmark test suite based on shared memory, is selected for experimental verification. The experimental results show that the solution proposed in this paper can dynamically provide a variety of resources for OpenMP program to meet program running requirements, effectively improve resource utilization efficiency and reduce program running costs.

Since the existing terrestrial fifth generation (5G) network has limited coverage, it is difficult to meet the growing demand for seamless network connection. Meanwhile, current network resource allocation methods mainly research on how to improve system performance only from the perspective of resource utilization, but rarely take users’ specific needs for network content into consideration. This brings severe challenges to efficient network service and flexible resource allocation. Therefore, we construct the content service-oriented resource allocation model for space–air–ground integrated sixth generation networks (SAGIN 6G), and formulate the three-sided matching issue among the space–air–ground integrated network equipment (SAGINE), content sources, and users. In this model, users request to establish connection with SAGIN which forwards users’ request to content service provider (CSP). CSP manages the creation of content data, and finally returns the requested content to users through SAGIN. For the content service-oriented resource allocation in SAGIN, finding the optimal stable three-sided matching with the largest cardinality is an NP-complete problem. Therefore, to efficiently solve the above issue, we design some reasonable restrictions and convert it to a restricted three-sided matching problem with size and cycle preferences. We further develop the content-oriented resource allocation algorithm (COR2A) and the user-oriented resource allocation algorithm (UOR2A) in a distributed manner. Extensive simulations verify our approach outperforms traditional benchmark resource allocation schemes in terms of system throughput, CSP revenue, and user experience.

This article investigates resource allocation in ATM networks and emphasizes bandwidth allocation. Resource allocation methods are categorized, and static and dynamic allocation strategies are compared. Dynamic allocation uses actual traffic behavior, while static allocation uses only the reference traffic condition given a priori. Examples of dynamic allocation strategies are available bit rate flow control, dynamic connection admission control, and dynamic VP bandwidth control. Dynamic resource allocation is shown to be promising for situations where the a priori reference model is unclear.

In a shared virtual computing environment, dynamic load changes as well as different quality requirements of applications in their lifetime give rise to dynamic and various capacity demands, which results in lower resource utilization and application quality using the existing static resource allocation. Furthermore, the total required capacities of all the hosted applications in current enterprise data centers, for example, Google, may surpass the capacities of the platform. In this paper, we argue that the existing techniques by turning on or off servers with the help of virtual machine (VM) migration is not enough. Instead, finding an optimized dynamic resource allocation method to solve the problem of on-demand resource provision for VMs is the key to improve the efficiency of data centers. However, the existing dynamic resource allocation methods only focus on either the local optimization within a server or central global optimization, limiting the efficiency of data centers. We propose a two-tiered on-demand resource allocation mechanism consisting of the local and global resource allocation with feedback to provide on-demand capacities to the concurrent applications. We model the on-demand resource allocation using optimization theory. Based on the proposed dynamic resource allocation mechanism and model, we propose a set of on-demand resource allocation algorithms. Our algorithms preferentially ensure performance of critical applications named by the data center manager when resource competition arises according to the time-varying capacity demands and the quality of applications. Using Rainbow, a Xen-based prototype we implemented, we evaluate the VM-based shared platform as well as the two-tiered on-demand resource allocation mechanism and algorithms. The experimental results show that Rainbow without dynamic resource allocation (Rainbow-NDA) provides 26 to 324 percent improvements in the application performance, as well as 26 percent higher average CPU utilization than traditional service computing framework, in which applications use exclusive servers. The two-tiered on-demand resource allocation further improves performance by 9 to 16 percent for those critical applications, 75 percent of the maximum performance improvement, introducing up to 5 percent performance degradations to others, with 1 to 5 percent improvements in the resource utilization in comparison with Rainbow-NDA.

Visual working memory (VWM) resources have been shown to be flexibly distributed according to item priority. This flexible allocation of resources may depend on attentional control, an executive function known to decline with age. In this study, we sought to determine how age differences in attentional control affect VWM performance when attention is flexibly allocated amongst targets of varying priority. Participants performed a delayed-recall task wherein item priority was varied. Error was modelled using a three-component mixture model to probe different aspects of performance (precision, guess-rate, and non-target errors). The flexible resource model offered a good fit to the data from both age groups, but older adults showed consistently lower precision and higher guess rates. Importantly, when demands on flexible resource allocation were highest, older adults showed more non-target errors, often swapping in the item that had a higher priority at encoding. Taken together, these results suggest that the ability to flexibly allocate attention in VWM is largely maintained with age, but older adults are less precise overall and sometimes swap in salient, but no longer relevant, items possibly due to their lessened ability to inhibit previously attended information.

Today Cloud computing is on demand as it offers dynamic flexible resource allocation, for reliable and guaranteed services in pay-as-you-use manner, to Cloud service users. So there must be a provision that all resources are made available to requesting users in efficient manner to satisfy their needs. This resource provision is done by considering the Service Level Agreements (SLA) and with the help of parallel processing. Recent work considers various strategies with single SLA parameter. Hence by considering multiple SLA parameter and resource allocation by preemption mechanism for high priority task execution can improve the resource utilization in Cloud. In this paper we propose an algorithm which considered Preemptable task execution and multiple SLA parameters such as memory, network bandwidth, and required CPU time. An obtained experimental results show that in a situation where resource contention is fierce our algorithm provides better utilization of resources.

The heterogeneity of the available protocols and hardware platforms makes validation in resource allocation a time-consuming and complex work. It needs to involve the hardware platforms, link layer and network layer to verify algorithms. To minimize the unnecessary and repetitive implementation of similar functionalities for different platforms, we present our resource allocation validation (RAV) middleware which supports the discovery of sensor networks and provides flexible resource allocation. RAV enables the user to specify XML-based deployment descriptor which can easily modify from link layer to network layer and customize the configuration of sensors. In the demonstration, three different resource allocation algorithms are tested to deploy a network, to dynamically reconfigure and to monitor the changes.

The extent and nature of the ability to control the allocation of mental resources between the components of a dual task was investigated in three separate experiments. Using a variable priority (demand) methodology it was found that subjects could manipulate their performance level, however their ability to meet specific demand levels was limited. Training subjects under single or dual-task conditions using a wide range of task demand significantly improved dual task performance and degree of control over resource allocation as compared to performance following practice under a narrow range of task demands or under single task fixed demand conditions. Single task performance among all groups improved to the same degree. It was concluded that training subjects under a wide range of task demands increases the range of performance levels over which mental resources can be flexibly allocated for those tasks and improves time sharing performance. Implications for the design of training for complex task performance are discussed.

The fifth generation (5G) mobile communication system is regard as a key enabler in promoting the deployment of Internet of Things (IoT), which is accompanied by the increasing service demands such like high data rate, enormous connection, and low latency. To meet these demands, network slicing has been envisioned as an efficient technology to customize infrastructures and allocate resources for 5G IoT services. However, due to various application backgrounds and ubiquitous social interactions of IoT services, the heterogeneous and social-driven resource requirement of users should be carefully assessed in resource allocation for the sliced 5G wireless network. In this paper, a novel nature-inspired wireless resource allocation scheme with slice characteristic perception is proposed, which comprehensively analyzes the properties of slices and converts them into a network profit model of resource utilization. Specifically, personalized service preferences and evolutionary interest relationships of users are exploited to model the complex and dynamic network environment with cellular automaton, and a biologically inspired allocation strategy of virtual wireless resource is proposed on the requirements of continuously updated user groups. Simulation results show that the proposed scheme achieves favorable resource utilization and low computational complexity, which favors the dynamic IoT slicing architecture and improves the efficiency and flexibility of resource allocation.

Teaching resources in higher education are an important part of the talent cultivation system of higher education institutions. Dynamic management and optimal allocation of teaching resources are the focus of the construction of each school, which reflects the teaching, research, and management level of the school to a certain extent. In this paper, after combining the current situation and management problems of teaching resources in six schools in City A and putting forward constructive opinions, we further use data envelopment analysis to study the efficiency of teaching resource allocation in School H in City A and put forward the method of resource optimization.The input redundancy rate of School X1 in School H during the three years of 2021-2023 is 30.25%, 44.15%, and 55.26%, respectively. The data shows that the school has an excess of teacher inputs and there is a shortage of resources for teachers. For the current dynamic management and resource allocation problems of teaching resources in A city school, this paper argues that the management of school teaching resources is a long-term and complex organic whole, and needs to be reformed in terms of structure, resource integration and management, and to construct a high-quality and efficient management model. In terms of resource optimization and allocation, schools can optimize the talent resource allocation mechanism and other aspects to promote the full allocation of teaching resources in higher education.

Quantum Machine Learning (QML) approaches introduce unique computational requirements that continuously emerge, from data encoding to model training, from data preparation to model deployment, thus spanning a wide range of possible scenarios. In contrast with classical machine learning, they require dynamic coordination of classical and quantum resources, such as the choice between real quantum processing units or simulators. Unfortunately, traditional MLOps frameworks, built around classical ML workflows, fail to accommodate this dynamic need for quantum resources throughout the pipeline. To address this limitation, we propose an MLOps framework that leverages cloud-native infrastructure, based on container orchestration, to support quantum-classical ML workflows, with dynamic allocation of quantum and classical resources, computational paradigm-agnostic orchestration, and flexible workflow management. These foundational factors unlock the potential of quantum machine learning through elastic hybrid architectures. Built on top of Kubernetes, our framework enables flexible allocation of quantum resources at any stage, without disrupting classical MLOps workflows and, consequently, ensuring traditional peculiarities, such as data and model versioning. This framework we design ensures consistent operations and fosters reproducibility across hybrid environments under a single infrastructure, hence providing a guiding framework for future-ready quantum-classical machine learning systems.

Cloud computing is emerging as an increasingly popular computing paradigm, allowing dynamic scaling of resources available to users as needed. This requires a highly accurate demand prediction and a resource allocation methodology. The existing methodologies for dynamic resource allocation do not provide effective performance isolation between the VM and Artificial Demand Analysis machines since it gets affected by interferences. To overcome these issues, this paper proposes a conceptual model and an effective algorithm to achieve dynamic resource allocation by migrating tasks or requests in VMs. At first, task demands from the multiple users go to the feature extraction process. In feature extraction, features of the user's tasks and cloud server are extracted. Next both features are reduced by using Modified PCA algorithm to reduce the dynamic resource allocation processing time. Finally, both the features are combined and resource allocation is performed using Hybrid Particle Swarm Optimization and Modified Genetic Algorithm (HPSO-MGA). Then the optimized task has been scheduled to particular VM for allocating the resources. The experimental result of the proposed resource allocation methodology indicates better performance when compared with the existing methods Firefly and Krill herd Load Balancing (LB). For 100 VMs the reliability of HPSO-MGA is 0.87 but the exiting krill herd LB and IDSA gives 0.78 and 0.85, which is lower than the proposed one.

With the advent of gaining popularity in cloud computing, there is an increase in demand of resources among the heterogeneous workload types on cloud. Resource management is a key challenging problem that is faced by the cloud service providers, by achieving business goals and agreed level of service with the subscribers. This paper focuses on dynamic resource allocation with risk analysis by meeting service level agreements. Further proposed framework handles heterogeneous workload types by dynamic capacity planning with risk assessment to maximise the profit and resource utilisation on clouds. In addition to advanced resource reservation, SLA-based scheduling/rescheduling with risks involved in resource allocation is considered in the proposed model. The experimental results demonstrate that proposed framework maximises the resource utilisation and profit gain of the cloud service provider when evaluated against widely used static configuration strategy.

We highlight the advantages of dynamic wavelength allocation and path rerouting in hybrid optical flow-switched data center networks compared with static electronic packet-switched data center networks. Current electronic packet-switched networks perform routing based on lookup tables and shortest path routing over high speed optical connections. However, load balancing and path rerouting are not designed in coordination with the optical data plane. In this work, we design and analyze the performance of load balancing and resource allocation in hybrid flow data center architectures. In the hybrid flow architecture, the transport layer and control plane are responsible for load balancing, congestion control and reliable data delivery in wavelength division multiplexed networks. The transport layer abstracts the underlying network and data link layers from user applications. Applications are unaware of whether flows are transmitted via the electronic data plane, optical data plane, or both, where the relevant metric for applications is transaction delay. We show that the data center architecture that minimizes delay in the presence of elephant flows and dynamic loads is the hybrid flow architecture with dynamic resource allocation.

Cloud computing is one among the emerging platforms in business, IT enterprise and mobile computing applications. Resources like Software, CPU, Memory and I/O devices etc. are utilized and charged as per the usage, instead of buying it. A Proper and efficient resource allocation in this dynamic cloud environment becomes the challenging task due to drastic increment in cloud usage. Various promising technologies have been developed to improve the efficiency of resource allocation process. But still there is some incompetency in terms of task scheduling and power consumption, when the system gets overloaded. So an energy efficient task scheduling algorithm is required to improve the efficiency of resource allocation process. In this paper an improved task scheduling and an optimal power minimization approach is proposed for efficient dynamic resource allocation process. Using prediction mechanism and dynamic resource table updating algorithm, efficiency of resource allocation in terms of task completion and response time is achieved. This framework brings an efficient result in terms of power reduction since it reduces the power consumption in data centers. The proposed approach gives accurate values for updating resource table. An efficient resource allocation is achieved by an improved task scheduling technique and reduced power consumption approach. The Simulation result gives 8% better results when comparing to other existing methods.