Search results

Efficient thermal management of central processing unit (CPU) cooling systems is vital in the context of advancing information technology and the demand for enhanced data processing speeds. This study aims to explore the thermal performance of a CPU cooling setup using a cylindrical porous metal foam heat sink.

Nanofluid flow through the metal foam is simulated using the Darcy–Brinkman–Forschheimer equation, accounting for magnetic field effects. The temperature distribution is modeled through the local thermal equilibrium equation, considering viscous dissipation. The problem’s governing partial differential equations are solved using the similarity method. The CPU’s hot surface serves as a solid wall, with nanofluid entering the heat sink as an impinging jet. Verification of the numerical results involves comparison with existing research, demonstrating strong agreement across numerical, analytical and experimental findings. Ansys Fluent® software is used to assess temperature, velocity and streamlines, yielding satisfactory results from an engineering standpoint.

Investigating critical parameters such as Darcy number (10⁻⁴ ≤ Da_D ≤ 10⁻²), aspect ratio (0.5 ≤ H/D ≤ 1.5), Reynolds number (5 ≤ Re_D,bf ≤ 3500), Eckert number (0 ≤ EC_bf ≤ 0.1) , porosity (0.85 ≤ ε ≤ 0.95), Hartmann number (0 ≤ Ha_D,bf ≤ 300) and the volume fraction of nanofluid (0 ≤ φ ≤ 0.1) reveals their impact on fluid flow and heat sink performance. Notably, Nusselt number will reduce 45%, rise 19.2%, decrease 14.1%, and decrease 0.15% for Reynolds numbers of 600, with rising porosity from 0.85 to 0.95, Darcy numbers from 10⁻⁴ to 10⁻², Eckert numbers from 0 to 0.1, and Hartman numbers from 0 to 300.

Despite notable progress in studying thermal management in CPU cooling systems using porous media and nanofluids, there are still significant gaps in the existing literature. First, few studies have considered the Darcy–Brinkman–Forchheimer equation, which accounts for non-Darcy effects and the flow and geometric interactions between coolant and porous medium. The influence of viscous dissipation on heat transfer in this specific geometry has also been largely overlooked. Additionally, while nanofluids and impinging jets have demonstrated potential in enhancing thermal performance, their utilization within porous media remains underexplored. Furthermore, the unique thermal and structural characteristics of porous media, along with the incorporation of a magnetic field, have not been fully investigated in this particular configuration. Consequently, this study aims to address these literature gaps and introduce novel advancements in analytical modeling, non-Darcy flow, viscous dissipation, nanofluid utilization, impinging jets, porous media characteristics and the impact of a magnetic field. These contributions hold promising prospects for improving CPU cooling system thermal management and have broader implications across various applications in the field.

Cloud computing services gained huge attention in recent years and many organizations started moving their business data traditional server to the cloud storage providers. However, increased data storage introduces challenges like inefficient usage of resources in the cloud storage, in order to meet the demands of users and maintain the service level agreement with the clients, the cloud server has to allocate the physical machine to the virtual machines as requested, but the random resource allocations procedures lead to inefficient utilization of resources.

This thesis focuses on resource allocation for reasonable utilization of resources. The overall framework comprises of cloudlets, broker, cloud information system, virtual machines, virtual machine manager, and data center. Existing first fit and best fit algorithms consider the minimization of the number of bins but do not consider leftover bins.

The proposed algorithm effectively utilizes the resources compared to first, best and worst fit algorithms. The effect of this utilization efficiency can be seen in metrics where central processing unit (CPU), bandwidth (BW), random access memory (RAM) and power consumption outperformed very well than other algorithms by saving 15 kHz of CPU, 92.6kbps of BW, 6GB of RAM and saved 3kW of power compared to first and best fit algorithms.

The proposed multi-objective bin packing algorithm is better for packing VMs on physical servers in order to better utilize different parameters such as memory availability, CPU speed, power and bandwidth availability in the physical machine.

In recent years, the demand for garments has significantly increased, requiring manufacturers to speed up their production to attract customers. Cut order planning (COP) is one of the most important processes in the apparel manufacturing industry. The appropriate stencil arrangement can reduce costs and fabric waste. The COP problem focuses on determining the size combination for a pattern, which is determined by the length of the cutting table, width, demand order, and height of the cutting equipment.

This study proposes new heuristics: genetic algorithm (GA), symbiotic organism search, and divide-and-search-based Lite heuristic and a One-by-One (ObO) heuristic to address the COP problem. The objective of the COP problem is to determine the optimal combination of stencils to meet demand requirements and minimize the total fabric length.

A comparison between our proposed heuristics and other simulated annealing and GA-based heuristics, and a hybrid approach (conventional algorithm + GA) was conducted to demonstrate the effectiveness and efficiency of the proposed heuristics. The test results show that the ObO heuristic can significantly improve the solution efficiency and find the near optimal solution for extreme demands.

This paper proposes a new heuristic, the One-by-One (ObO) heuristic, to solve the COP problem. The results show that the proposed approaches overcome the long operation time required to determine the fitting arrangement of stencils. In particular, our proposed ObO heuristic can significantly improve the solution efficiency, i.e. finding the near optimal solution for extreme demands within a very short time.

In the present work, we focus on developing an in-house parallel meshless local Petrov-Galerkin (MLPG) code for the analysis of heat conduction in two-dimensional and three-dimensional regular as well as complex geometries.

The parallel MLPG code has been implemented using open multi-processing (OpenMP) application programming interface (API) on the shared memory multicore CPU architecture. Numerical simulations have been performed to find the critical regions of the serial code, and an OpenMP-based parallel MLPG code is developed, considering the critical regions of the sequential code.

Based on performance parameters such as speed-up and parallel efficiency, the credibility of the parallelization procedure has been established. Maximum speed-up and parallel efficiency are 10.94 and 0.92 for regular three-dimensional geometry (343,000 nodes). Results demonstrate the suitability of parallelization for larger nodes as parallel efficiency and speed-up are more for the larger nodes.

Few attempts have been made in parallel implementation of the MLPG method for solving large-scale industrial problems. Although the literature suggests that message-passing interface (MPI) based parallel MLPG codes have been developed, the OpenMP model has rarely been touched. This work is an attempt at the development of OpenMP-based parallel MLPG code for the very first time.

This study explores the interconnectedness and complexity of risk-varied climate initiatives such as green bonds (GBs), emissions trading systems (ETS) and socially responsible investments (SRI). The analysis covers the period from September 2011 to August 2022, using six indices: three representing climate initiatives and three indicating uncertainty.

To achieve this, the study first examines dynamic lead-lag relations and correlation patterns in the time-frequency domain to analyse the returns of the series. Additionally, it applies an innovative approach to investigate the predictability of uncertainty measurements of climate initiatives across various market conditions and frequency spillovers in the short, medium and long run.

The findings indicate changing relationships between the series, increased linkages during turbulent market periods and strong co-movements within the network. The ETS is recommended for diversification and hedging against uncertainty indices, whereas the GB may be suitable for long-term diversification.

This study highlights the role of climate initiatives as potential hedges and contagion amplifiers during crises, with implications for policy recommendations and the asymmetric effects on market connectedness.

The paper answers questions that previous studies have not and contributes to the literature regarding financial risk management and social responsibility.

Metaheuristic algorithms based on biology, evolutionary theory and physical principles, have been widely developed for complex global optimization. This paper aims to present a new hybrid optimization algorithm that combines the characteristics of biogeography-based optimization (BBO), invasive weed optimization (IWO) and genetic algorithms (GAs).

The significant difference between the new algorithm and original optimizers is a periodic selection scheme for offspring. The selection criterion is a function of cyclic discharge and the fitness of populations. It differs from traditional optimization methods where the elite always gains advantages. With this method, fitter populations may still be rejected, while poorer ones might be likely retained. The selection scheme is applied to help escape from local optima and maintain solution diversity.

The efficiency of the proposed method is tested on 13 high-dimensional, nonlinear benchmark functions and a homogenous slope stability problem. The results of the benchmark function show that the new method performs well in terms of accuracy and solution diversity. The algorithm converges with a magnitude of 10-4, compared to 102 in BBO and 10-2 in IWO. In the slope stability problem, the safety factor acquired by the analogy of slope erosion (ASE) is closer to the recommended value.

This paper introduces a periodic selection strategy and constructs a hybrid optimizer, which enhances the global exploration capacity of metaheuristic algorithms.

This study aims to propose novel edge device-tailored federated learning algorithms of local classifiers (stochastic gradient descent, support vector machines), namely, FL-lSGD and FL-lSVM. These algorithms are designed to address the challenge of large-scale ImageNet classification.

The authors’ FL-lSGD and FL-lSVM trains in a parallel and incremental manner to build an ensemble local classifier on Raspberry Pis without requiring data exchange. The algorithms load small data blocks of the local training subset stored on the Raspberry Pi sequentially to train the local classifiers. The data block is split into k partitions using the k-means algorithm, and models are trained in parallel on each data partition to enable local data classification.

Empirical test results on the ImageNet data set show that the authors’ FL-lSGD and FL-lSVM algorithms with 4 Raspberry Pis (Quad core Cortex-A72, ARM v8, 64-bit SoC @ 1.5GHz, 4GB RAM) are faster than the state-of-the-art LIBLINEAR algorithm run on a PC (Intel(R) Core i7-4790 CPU, 3.6 GHz, 4 cores, 32GB RAM).

Efficiently addressing the challenge of large-scale ImageNet classification, the authors’ novel federated learning algorithms of local classifiers have been tailored to work on the Raspberry Pi. These algorithms can handle 1,281,167 images and 1,000 classes effectively.

This study aims to deal with the multi-mode resource-constrained project scheduling problem (MRCPSP) with the ability to transport resources among multiple sites, aiming to minimize the total completion time and the total cost of the project simultaneously.

To deal with the problem under consideration, a bi-objective optimization model is developed. All activities are interconnected by finish-start precedence relations, and pre-emption is not allowed. Then, the ɛ-constraint optimization method is used to solve 24 different-sized instances, ranging from 5 to 120 activities, and report the makespan, total cost and CPU time. A set of Pareto-optimal solutions are determined for some instances, and sensitivity analyses are performed to find the impact of changing parameters on objective values.

Results highlight the importance of resource transportability assumption on project completion time and cost, providing useful insights for decision makers and practitioners.

A novel bi-objective optimization model is proposed to deal with the multi-site MRCPSP, considering both the cost and time of resource transportation between multiple sites. To the best of the authors’ knowledge, none of the studies in the project scheduling area has yet addressed this problem.

In regarding to operational efficiency and safety improvements, multiple tower crane service scheduling problem is one of the main problems related to tower crane operation but receives limited attention. The current work presents an optimization model for scheduling multiple tower cranes' service with overlapping areas while achieving collision-free between cranes.

The cooperative coevolutionary genetic algorithm (CCGA) was proposed to solve this model. Considering the possible types of cross-tasks, through effectively allocating overlapping area tasks to each crane and then prioritizing the assigned tasks for each crane, the makespan of tower cranes was minimized and the crane collision avoidance was achieved by only allowing one crane entering the overlapping area at one time. A case study of the mega project Daxing International Airport has been investigated to evaluate the performance of the proposed algorithm.

The computational results showed that the CCGA algorithm outperforms two compared algorithms in terms of the optimal makespan and the CPU time. Also, the convergence of CCGA was discussed and compared, which was better than that of traditional genetic algorithm (TGA) for small-sized set (50 tasks) and was almost the same as TGA for large-sized sets.

This paper can provide new perspectives on multiple tower crane service sequencing problem. The proposed model and algorithm can be applied directly to enhance the operational efficiency of tower cranes on construction site.

This paper aims to review in-memory computing (IMC) for machine learning (ML) applications from history, architectures and options aspects. In this review, the authors investigate different architectural aspects and collect and provide our comparative evaluations.

Collecting over 40 IMC papers related to hardware design and optimization techniques of recent years, then classify them into three optimization option categories: optimization through graphic processing unit (GPU), optimization through reduced precision and optimization through hardware accelerator. Then, the authors brief those techniques in aspects such as what kind of data set it applied, how it is designed and what is the contribution of this design.

ML algorithms are potent tools accommodated on IMC architecture. Although general-purpose hardware (central processing units and GPUs) can supply explicit solutions, their energy efficiencies have limitations because of their excessive flexibility support. On the other hand, hardware accelerators (field programmable gate arrays and application-specific integrated circuits) win on the energy efficiency aspect, but individual accelerator often adapts exclusively to ax single ML approach (family). From a long hardware evolution perspective, hardware/software collaboration heterogeneity design from hybrid platforms is an option for the researcher.

IMC’s optimization enables high-speed processing, increases performance and analyzes massive volumes of data in real-time. This work reviews IMC and its evolution. Then, the authors categorize three optimization paths for the IMC architecture to improve performance metrics.