Home / Advanced Search

  • Title/Keywords

  • Author/Affliations

  • Journal

  • Article Type

  • Start Year

  • End Year

Update SearchingClear
  • Articles
  • Online
Search Results (12)
  • Open Access

    ARTICLE

    Hyper-Heuristic Task Scheduling Algorithm Based on Reinforcement Learning in Cloud Computing

    Lei Yin1, Chang Sun2, Ming Gao3, Yadong Fang4, Ming Li1, Fengyu Zhou1,*

    Intelligent Automation & Soft Computing, Vol.37, No.2, pp. 1587-1608, 2023, DOI:10.32604/iasc.2023.039380

    Abstract The solution strategy of the heuristic algorithm is pre-set and has good performance in the conventional cloud resource scheduling process. However, for complex and dynamic cloud service scheduling tasks, due to the difference in service attributes, the solution efficiency of a single strategy is low for such problems. In this paper, we presents a hyper-heuristic algorithm based on reinforcement learning (HHRL) to optimize the completion time of the task sequence. Firstly, In the reward table setting stage of HHRL, we introduce population diversity and integrate maximum time to comprehensively determine the task scheduling and the selection of low-level heuristic strategies.… More >

  • Open Access

    ARTICLE

    An Integrated Scheduling Algorithm for the Same Equipment Process Sequencing Based on the Root-Subtree Vertical and Horizontal Pre-Scheduling

    Zhiqiang Xie1,*, Haikun Teng1, Anak Agung Ayu Putri Ardyanti1, Xu Yu2

    CMES-Computer Modeling in Engineering & Sciences, Vol.134, No.1, pp. 179-200, 2023, DOI:10.32604/cmes.2022.021550

    Abstract Given the existing integrated scheduling algorithms, all processes are ordered and scheduled overall, and these algorithms ignore the influence of the vertical and horizontal characteristics of the product process tree on the product scheduling effect. This paper presents an integrated scheduling algorithm for the same equipment process sequencing based on the Root-Subtree horizontal and vertical pre-scheduling to solve the above problem. Firstly, the tree decomposition method is used to extract the root node to split the process tree into several Root-Subtrees, and the Root-Subtree priority is set from large to small through the optimal completion time of vertical and horizontal… More >

  • Open Access

    ARTICLE

    OFDM-CFO and Resource Scheduling Algorithm Using Fuzzy Linear-CFO

    M. Prabhu1,*, B. Muthu Kumar2

    Intelligent Automation & Soft Computing, Vol.35, No.2, pp. 2513-2525, 2023, DOI:10.32604/iasc.2023.027823

    Abstract Orthogonal Frequency-Division Multiplexing (OFDM) is the form of a digital system and a way of encoding digital data across multiple frequency components that are used in telecommunication services. Carrier Frequency Offset (CFO) inaccuracy is a major disadvantage of OFDM. This paper proposed a feasible and elegant fuzzy-based resource allocation technique, that overcomes the constraints of the CFO. The suggested Fuzzy linear CFO estimation (FL-CFO) not only estimates the CFO with increased precision but also allocates resources effectively, and achieves maximum utilization of dynamic resources. The suggested FL-CFO error estimation algorithm in OFDM systems employing 1-bit Quadrate errors ADC (1-bit QE)… More >

  • Open Access

    ARTICLE

    Hybridization of Metaheuristics Based Energy Efficient Scheduling Algorithm for Multi-Core Systems

    J. Jean Justus1, U. Sakthi2, K. Priyadarshini3, B. Thiyaneswaran4, Masoud Alajmi5, Marwa Obayya6, Manar Ahmed Hamza7,*

    Computer Systems Science and Engineering, Vol.44, No.1, pp. 205-219, 2023, DOI:10.32604/csse.2023.025256

    Abstract The developments of multi-core systems (MCS) have considerably improved the existing technologies in the field of computer architecture. The MCS comprises several processors that are heterogeneous for resource capacities, working environments, topologies, and so on. The existing multi-core technology unlocks additional research opportunities for energy minimization by the use of effective task scheduling. At the same time, the task scheduling process is yet to be explored in the multi-core systems. This paper presents a new hybrid genetic algorithm (GA) with a krill herd (KH) based energy-efficient scheduling technique for multi-core systems (GAKH-SMCS). The goal of the GAKH-SMCS technique is to… More >

  • Open Access

    ARTICLE

    Resource Allocation Using Phase Change Hyper Switching Algorithm in the Cloud Environment

    J. Praveenchandar1,*, A. Tamilarasi2

    Intelligent Automation & Soft Computing, Vol.34, No.3, pp. 1839-1850, 2022, DOI:10.32604/iasc.2022.026354

    Abstract Cloud computing is one of the emerging technology; it provides various services like Software as a Service, Platform as a Service, and Infrastructure as a Service on demand. It reduces the cost of traditional computing by renting the resources instead of buying them for a huge cost. The usage of cloud resources is increasing day by day. Due to the heavy workload, all users cannot get uninterrupted service at some time. And the response time of some users also gets increased. Resource allocation is one of the primary issues of a cloud environment, one of the challenging problems is improving… More >

  • Open Access

    ARTICLE

    Cost Efficient Scheduling Using Smart Contract Cognizant Ethereum for IoMT

    G. Ravikumar1, K. Venkatachalam2, Mehedi Masud3, Mohamed Abouhawwash4,5,*

    Intelligent Automation & Soft Computing, Vol.33, No.2, pp. 865-877, 2022, DOI:10.32604/iasc.2022.024278

    Abstract Recently internet of medical things (IoMT) act as a smart doctor using sensor wearable’s device in human body. This smart doctor device senses necessary medical data from human and transfer via network immediately to physician. It is important to transfer sensitive data very securely. Blockchain becomes trending technology to provide high security to both end users in the network. Traditionally security structure is relying on cryptographic techniques which is very expensive and takes more time in securely transmitting data. To overcome this issue, this paper builds a cost effective, blockchain with IoMT using fog-cloud computing. The aim of research is… More >

  • Open Access

    ARTICLE

    ATS: A Novel Time-Sharing CPU Scheduling Algorithm Based on Features Similarities

    Samih M. Mostafa1,*, Sahar Ahmed Idris2, Manjit Kaur3

    CMC-Computers, Materials & Continua, Vol.70, No.3, pp. 6271-6288, 2022, DOI:10.32604/cmc.2022.021978

    Abstract Minimizing time cost in time-shared operating systems is considered basic and essential task, and it is the most significant goal for the researchers who interested in CPU scheduling algorithms. Waiting time, turnaround time, and number of context switches are the most time cost criteria used to compare between CPU scheduling algorithms. CPU scheduling algorithms are divided into non-preemptive and preemptive. Round Robin (RR) algorithm is the most famous as it is the basis for all the algorithms used in time-sharing. In this paper, the authors proposed a novel CPU scheduling algorithm based on RR. The proposed algorithm is called Adjustable… More >

  • Open Access

    ARTICLE

    Novel Power-Aware Optimization Methodology and Efficient Task Scheduling Algorithm

    K. Sathis Kumar1,*, K. Paramasivam2

    Computer Systems Science and Engineering, Vol.41, No.1, pp. 209-224, 2022, DOI:10.32604/csse.2022.019531

    Abstract The performance of central processing units (CPUs) can be enhanced by integrating multiple cores into a single chip. Cpu performance can be improved by allocating the tasks using intelligent strategy. If Small tasks wait for long time or executes for long time, then CPU consumes more power. Thus, the amount of power consumed by CPUs can be reduced without increasing the frequency. Lines are used to connect cores, which are organized together to form a network called network on chips (NOCs). NOCs are mainly used in the design of processors. However, its performance can still be enhanced by reducing power… More >

  • Open Access

    ARTICLE

    High Throughput Scheduling Algorithms for Input Queued Packet Switches

    R. Chithra Devi1,*, D. Jemi Florinabel2, Narayanan Prasanth3

    CMC-Computers, Materials & Continua, Vol.70, No.1, pp. 1527-1540, 2022, DOI:10.32604/cmc.2022.019343

    Abstract The high-performance computing paradigm needs high-speed switching fabrics to meet the heavy traffic generated by their applications. These switching fabrics are efficiently driven by the deployed scheduling algorithms. In this paper, we proposed two scheduling algorithms for input queued switches whose operations are based on ranking procedures. At first, we proposed a Simple 2-Bit (S2B) scheme which uses binary ranking procedure and queue size for scheduling the packets. Here, the Virtual Output Queue (VOQ) set with maximum number of empty queues receives higher rank than other VOQ’s. Through simulation, we showed S2B has better throughput performance than Highest Ranking First… More >

  • Open Access

    ARTICLE

    Scheduling Algorithm for Grid Computing Using Shortest Job First with Time Quantum

    Raham Hashim Yosuf1, Rania A. Mokhtar2, Rashid A. Saeed2,*, Hesham Alhumyani2, S. Abdel-Khalek3

    Intelligent Automation & Soft Computing, Vol.31, No.1, pp. 581-590, 2022, DOI:10.32604/iasc.2022.019928

    Abstract The grid computing is one of the strong initiatives and technologies that has been introduced in the last decade for improve the resources utilization, optimization and provide very high throughput computation for wide range of applications. To attain these goals an effective scheduling for grid systems is a vital issue to realize the intended performance. The processes scheduling could be executed in various methods and protocols that have been extensively address in the literature. This works utilized shortest process first (SPF) protocol which gives the shortest jobs the highest priorities. For longer jobs, it should have lower priorities and wait… More >

Displaying 1-10 on page 1 of 12. Per Page