Skip to content
Free planNo credit card requiredStart writing
AI for Research home
AI for Research home
Dashboard
Sign inGet started

Search 250 million research papers

Read the abstract, see who wrote it and who cites it, and get the citation in APA, MLA, Chicago or Harvard.

About 1,093 papers for “stack allocation”

SECURED RESOURCE ALLOCATION IN CLOUD NETWORKS MANIPULATING ADAPTIVE DATA STACK ALGORITHM

Dr.R.Pragaladan N.Sureshbabu · 2021

Cloud computing has become highly demandable due to its broad range of beneficial properties like on-demand self-services, resource pooling, quick elasticity, estimated services etc. However, in cloud networks, secured resource allocation among users with improved privacy and authentication is a challenging issue. Henceforth, in this paper an efficient cloud resource architecture is proposed for the even exploitation of storage resources. Thedata is maintained, structured, and made accessible to authorized users with improved allocation property eliminating threats occurring inside. The allocation of resources is efficiently performed by an Adaptive Data Stack (ADS) encryption algorithm which searches the appropriate storage location by providing individual storage key. The proposed algorithm offers high privacy and improved confidentiality providing direct access of storage locations for the users. The simulation is performed by adopting Visual C# in which outputs indicate that the proposed approach does resource allocation consuming minimal time utilizing efficient storage in cloud server.

Cited by 0

Escape analysis and stack allocation of Java objects in the CACAO VM

Molnár, Peter · reposiTUm (TU Wien) · 2009

Escape analysis is a static code analysis that determines, whether the lifetime of objects exceeds the lifetime of their creation site. The additional knowledge gained through escape analysis can be used to optimize memory management and synchronization in a virtual machine.<br />In the context of this thesis, escape analysis has been implemented for the CACAO virtual machine. The analysis proceeds in two stages:<br />intraprocedural analysis computes escape information for allocation sites within a single method and call-context agnostic summary information, that is used for interprocedural analysis. Escape information is used to allocate a subset of thread-local Java objects on the call stack. The implementation and the modifications of the virtual machine are described in detail.<br />Finally, the implementation is evaluated by benchmarking using the Spec JVM98 and the Dacapo benchmark suites. In selected Spec benchmarks, 50% to 90% of all objects get allocated on the call stack leading to an execution time reduction of up to 40%.

Cited by 0Open access

Experimental validation of an optimized power allocation strategy for multi-stack fuel cell

Anthony Roy, Jean-Christophe Olivier, François Auger et al. · 2022 IEEE 31st International Symposium on Industrial Electronics (ISIE) · 2022

Hydrogen is more and more considered for the decarbonization of energy uses, especially for transport applications. To reach a power range of several hundred kilowatts usually met in high power applications, an association of fuel cells in multi-stack is necessary. An adapted control must therefore be designed to share the requested power among the fuel cells. This paper presents an optimized power allocation strategy based on the minimization of the consumption of the stacks. The polarization curves are considered to take the fuel cell characteristics and its state of health into account. The proposed control strategy is experimentally validated thanks to a computation in real-time on a test bench, emulating four stacks of fuel cells with different states of health. The results show the effectiveness of the developed strategy, allowing the consumption to be reduced by 1.2 % compared to a strategy based on a fair distribution. Moreover, the reconfigurability of the power allocation is validated by considering the unavailability of some of the stacks.

Cited by 3Open access

Developing a Hybrid Stack Mode for Dynamic Yard Allocation Strategy of Export Containers

Junliang He, Wei Mi, Dao Fang Chang et al. · Applied Mechanics and Materials · 2011

In this paper, a dynamic yard allocation strategy of export containers is proposed based on a hybrid stack mode. Firstly, a 0-1 programming model is developed for the problem. Accordingly, the model’s objective function is subject to the minimization of the total re-shuffle containers which are buried beneath other containers but heavier. To resolve the NP-hard problem regarding the dynamic yard allocation model, a hybrid algorithm, which applies heuristic rules and genetic algorithm, is then employed. Subsequently, a case study is used for system illustration. Consequently, it could be found from computational results that this approach paves a venue for resolving the dynamic yard allocation problem of export containers.

Cited by 0

Experimenting with Hybrid Quantum Optimization in HPC Software Stack for CPU Register Allocation

Brice Chichereau, Stéphane Vialle, Patrick Carribault · HAL (Le Centre pour la Communication Scientifique Directe) · 2023

Quantum computers exploit the particular behavior of quantum physical systems to solve some problems in a different way than classical computers. We are now approaching the point where quantum computing could provide real advantages over classical methods. The computational capabilities of quantum systems will soon be available in future supercomputer architectures as hardware accelerators called Quantum Processing Units (QPU). From optimizing compilers to task scheduling, the High-Performance Computing (HPC) software stack could benefit from the advantages of quantum computing. We look here at the problem of register allocation, a crucial part of modern optimizing compilers. We propose a simple proof-of-concept hybrid quantum algorithm based on QAOA to solve this problem. We implement the algorithm and integrate it directly into GCC, a well-known modern compiler. The performance of the algorithm is evaluated against the simple Chaitin-Briggs heuristic as well as GCC's register allocator. While our proposed algorithm lags behind GCC's modern heuristics, it is a good first step in the design of useful quantum algorithms for the classical HPC software stack.

Cited by 1Open access

SBASH Stack Based Allocation of Sheer Window Architecture for Real Time Stream Data Processing

Devesh Kumar Lal, Ugrasen Suman · International Journal of Data Analytics · 2019

The processing of real-time data streams is complex with large number of volume and variety. The volume and variety of data streams enhances a number of processing units to run in real time. The required number of processing units used for processing data streams are lowered by using a windowing mechanism. Therefore, the appropriate size of window selection is vital for stream data processing. The coarse size window will directly affect the overall processing time. On the other hand, a finely sized window has to deal with an increased number of management costs. In order to manage such streams of data, we have proposed a SBASH architecture, which can be helpful for determining a unipartite size of a sheer window. The sheer window reduces the overall latency of data stream processing by a certain extent. The time complexity to process such sheer window is equivalent to w log n w. These windows are allocated and retrieved in a stack-based manner, where stacks ≥ n, which is helpful in reducing the number of comparisons made during retrieval.

Cited by 2

Joint Optimization of Energy Consumption and Truck Transfer by Stack Allocation in Steel Warehouses

Hongwei Wang, Zhezhuang Xu, Jinlong Wang et al. · 2024

Due to the continuous growth in steel market demand and the shift towards small batches and multiple varieties, efficient storage management has become a key factor in increasing the profitability of logistics parks. However, the current storage methods, due to the unreasonable allocation of stack positions, still result in energy waste during the dispatch phase and the need for trucks to pick up goods across multiple yards. To address these challenges, this paper proposes a comprehensive optimization scheme to reduce truck transfers and energy consumption in steel product dispatch. First, we constructed an optimization problem model that integrates the spatial layout of the logistics park and order data, aiming to maximize the correlation between steel products within the same yard and reduce the total energy consumption during the dispatch phase. Subsequently, a new algorithm called Enhanced Greedy and Tabu-Assisted Adaptive Large Neighborhood Search (EGTA-ALNS) is introduced. Experimental results demonstrate that the proposed algorithm outperforms existing ones in terms of solving speed and scale. It effectively optimizes energy consumption during steel dispatch and reduces the number of truck transfers.

Cited by 0

Linear-Time register allocation for a fixed number of registers and no stack variables

Hans L. Bodlaender, Jens Gustedt, Jan Arne Telle · HAL (Le Centre pour la Communication Scientifique Directe) · 1997

We show that for any fixed} number of registers there is a linear-time algorithm which given a structured (equiv goto}-free) program finds, if possible, an allocation of variables to registers without using intermediate storage. Our algorithm takes rescheduling} into account, {sl i.e.} that straight-line sequences of statements may be reordered to achieve a better register allocation as long as the data flow of the program is not affected. par If we allow registers of different types, e.g.} for integers and floats, we can give only a polynomial time algorithm. In fact we show that if we allow for registers of at least two different types and also for rescheduling then the problem immediately becomes hard for the W-hierarchy which is a strong indication that no O(nc) algorithm exists with c independent on the number of registers.

Cited by 7Open access

Smart Vehicle Service Management System with Automated Parking Allocation Using Full-Stack Web Technologies

Vignesh Kumar R, Surabhi K.S · INTERANTIONAL JOURNAL OF SCIENTIFIC RESEARCH IN ENGINEERING AND MANAGEMENT · 2026

ABSTRACT The rapid expansion of the automobile industry has significantly increased the operational complexity of vehicle service centers. Service centers are required to manage multiple activities simultaneously, including customer handling, service scheduling, technician coordination, spare parts inventory control, billing operations, and parking space management. Traditional service center management approaches often rely on manual documentation and fragmented digital tools, which lead to inefficient workflow execution, data inconsistency, delayed service delivery, and poor resource utilization. This research presents the design and implementation of a Smart Vehicle Service Management System integrated with an Automated Parking Slot Allocation mechanism to improve service center efficiency and operational transparency. The proposed system provides a centralized digital platform for managing customer records, vehicle service history, technician assignments, real-time inventory updates, automated billing generation, and intelligent parking slot distribution. By leveraging full-stack web technologies, the system ensures scalability, security, and real-time accessibility. The automated parking module dynamically monitors slot availability and allocates parking resources to incoming vehicles, thereby reducing congestion and improving spatial utilization. The implementation of this integrated solution demonstrates enhanced workflow automation, reduced service processing time, and improved customer satisfaction. KEYWORDS — vehicle service automation, smart parking management, full stack web systems, resource optimization, service center digitalization

Cited by 0