检索结果-内蒙古大学图书馆

作者： Rinku, Dhruva R. Asha Rani, M. Department of ECE CVR College of Engineering Hyderabad India Department of ECE JNT University Hyderabad India

Computers are taking up great part in technology evolution. They perform many tasks quickly and reliably when compared to humans, opening new avenues. One important aspect of computers is multitasking that enables a system to execute multiple tasks at a time. Scheduler is an object of the kernel that divides CPU time among various processes, based on any specific policy including, but not limited to, response time, throughput, and interactivity. Scheduler works differently for single core and multi-core processor environment. There are different scheduling algorithms for multicore processor based on required performance criteria. In this work we have proposed and observed the simulation of different scheduling algorithms at user level for single core and multicore and compared the different metrics like average waiting time, turnaround time, CPU utilization and number of context switches in graphical manner and observed that the performance improvement in multicore environment compared to single core processor. © 2020, Springer Nature Switzerland AG.

关键词： scheduling algorithms

来源：评论

学校读者我要写书评

暂无评论

Performance Analysis of Real-Time scheduling algorithms 20

Performance Analysis of Real-Time Scheduling Algorithms

引用

2020 International Conference on Internet Computing for Science and Engineering, ICICSE 2020 and the 13th International Conference on Advanced Computer Theory and Engineering, ICACTE 2020

作者： Selim, Arwa Z. El-Attar, Noha E. Ghoneim, M.E. Awad, Wael A. Department of Mathematics and Computer Science Port Said University Port Said Egypt Benha University Benha Egypt Mathematics Science Department Umm Al-Qura University

ISBN: (纸本)9781450377348

Real-time systems are intensively used nowadays. scheduling algorithms are very important to manage the scheduling of tasks in real-time systems. In this paper we give an overview on the real-time scheduling techniques for uniprocessors and multiprocessors, then we present a comparison between the multiprocessor scheduling algorithms which are classified into partitioning and global scheduling algorithms. The results achieved from the comparison have showed that the parameters such as makespan, waiting time, missed deadlines and task preemptions are better in performance when using partitioned scheduling algorithms than that for global scheduling algorithms when the number of tasks is small. While when the number of tasks increased, it gives more better performance when using global scheduling algorithms than partitioned scheduling algorithms using all parameters except for some of the algorithms gave low performance in missed deadlines, they give a high number of missed deadlines. But in total when the number of tasks increased the global scheduling algorithms gives better performance than partitioned scheduling algorithms. © 2020 ACM.

关键词： scheduling algorithms

来源：评论

学校读者我要写书评

暂无评论

Resource efficient stream processing platform with latency-aware scheduling algorithms 12

Resource efficient stream processing platform with latency-a...

引用

12th USENIX Workshop on Hot Topics in Cloud Computing, HotCloud 2020, co-located with USENIX ATC 2020

作者： Morisawa, Yuta Suzuki, Masaki Kitahara, Takeshi KDDI Research Inc.

We presented a novel platform dedicated to stream processing that improved resource efficiency by sharing resources among applications. The platform utilized latency-aware schedulers to handle stream applications with heterogeneous SLAs and workloads. We implemented the prototype in Spark Structured Streaming and evaluated the platform with pseudo IoT services. The result showed that our platform outperformed default Spark Structured Streaming while reducing the necessary CPU cores by 36%. We further compared the adaptability of the schedulers and found that one of the schedulers reduced the SLA violations by 90% compared to the default FAIR when the platform was overloaded. © HotCloud 2020 - 12th USENIX Workshop on Hot Topics in Cloud Computing, co-located with USENIX ATC 2020. All rights reserved.

关键词： scheduling algorithms

来源：评论

学校读者我要写书评

暂无评论

Design of Joint Relay Placement and scheduling algorithms for Time-Slotted Networks with Half-Duplex Constraints

Design of Joint Relay Placement and Scheduling Algorithms fo...

引用

International Communication Systems and Networks and Workshops, COMSNETS

作者： Harshavardhana Togaleri Gowda Pragya Shah Vineeth Bala Sukumaran Indian Institute of Space Science and Technology (IIST) Thiruvananthapuram India IIST

ISBN: (数字)9781728191270

ISBN: (纸本)9781728191287

Industrial Internet-of-Things, automation, and process control applications require communication networks with a high degree of reliability, low energy expenditure, and low latency. Convergecast communication wherein all nodes in the network transmit data to a common base station is a common paradigm for such applications. Time slotted networks which support deterministic scheduling, such as 802.15.4e Time Slotted Channel Hopping (TSCH) multiple access (MAC) protocol, are well suited for such applications. In this paper, we consider a joint relay selection and scheduling problem for convergecast on a multihop wireless network using single channel TSCH MAC protocol. The objective of the problem is to reduce both the number of relay nodes required for network connectivity as well as the slot-frame duration for a periodic deterministic convergecast schedule. For tree networks with half-duplex constraints we obtain a lower bound on the minimum slot-frame duration and show that the relay selection and scheduling problem can be decoupled. We propose a heuristic scheduling algorithm which is shown to achieve the above lower bound using simulations. For the NP-hard relay selection problem, we propose a polynomial time relay selection algorithm with an improved approximation ratio. The performance of our relay selection and scheduling algorithms are studied via simulations on randomly generated graphs.

关键词： Schedules Job shop scheduling scheduling algorithms Wireless networks Spread spectrum communication Media Access Protocol Relays

来源：评论

学校读者我要写书评

暂无评论

Energy-Efficient scheduling algorithms with Reliability Goal on Heterogeneous Embedded Systems

Energy-Efficient Scheduling Algorithms with Reliability Goal...

引用

IEEE International Conference on Big Data and Cloud Computing (BdCloud)

作者： Yu Han Wei Hu Jing Liu Yu Gan Wuhan University of Science and Technology Wuhan China

In this paper, we are trying to find a algorithm for scheduling DAG (Directed Acyclic Graph) tasks in heterogeneous embedded systems to minimize energy consumption while meeting the reliability requirement. Like many traditional algorithms, we divide the task scheduling algorithm into two phases, the task priority calculation phase and the task allocation phase. In the task priority calculation phase, we proposes a priority calculation algorithm IOD based on the difference in task’s input and output data. In the task allocation stage, we proposes a task allocation algorithm based on fault-tolerant technology of task replication and DVFS technology. Combining the two phase, we get three scheduling algorithms, IODS, IODQ and IODR. In the experimental part, we compare the performance of the algorithm proposed in this paper with existing research algorithms (EFSRG algorithm and HRRM algorithm). The analysis of experimental results shows that the IODS algorithm is a better choice.

关键词： Energy consumption Fault tolerance Directed acyclic graph Embedded systems scheduling algorithms Fault tolerant systems scheduling

来源：评论

学校读者我要写书评

暂无评论

Review of distributed integrated scheduling algorithms

Review of distributed integrated scheduling algorithms

引用

Space-Air-Ground Computing (SAGC), International Conference on

作者： Zhen Wang Xiaohuan Zhang Shuhong Peng School of Computer Science and Engineering Huizhou University Huizhou China

ISBN: (纸本)9781665400121

The research object of integrated scheduling Institute is single piece and small batch order production. This kind of order is characterized by multiple varieties and small batch, which puts forward a severe test to the flexible production capacity of enterprises. Nowadays, with the rise of Internet of things technology, collaborative cooperation among enterprises is possible. Distributed collaborative manufacturing can effectively integrate enterprise resources, reduce the risks caused by enterprises fighting alone, improve the flexible production capacity of enterprises, and finally enable manufacturing enterprises to improve production efficiency and reduce unknown risks. However, the research on distributed integrated scheduling problem is still in its infancy, and there are few research results. This paper analyzes and studies the research status of the problem from four aspects: symmetric resource distributed integrated scheduling problem, asymmetric resource distributed integrated scheduling problem, multi-objective distributed integrated scheduling problem and special distributed integrated scheduling problem, points out some directions and contents of distributed integrated scheduling optimization algorithm to be further studied, and puts forward suggestions for further research.

关键词： Job shop scheduling scheduling algorithms Collaboration Production Manufacturing Internet of Things Optimization

来源：评论

学校读者我要写书评

暂无评论

scheduling algorithms for the revised pdpsort 16

Scheduling algorithms for the revised pdpsort

引用

16th International Conference on Electrical Engineering/Electronics, Computer, Telecommunications and Information Technology, ECTI-CON 2019

作者： Rattanatranurak, Apisit Kittitornkun, Surin Suan Sunandha Rajabhat University Computer Engineering Fac. of Industrial Technology Bangkok Thailand King Mongkuts Institute of Technology Ladkrabang Computer Engineering Fac. of Engineering Bangkok Thailand

ISBN: (纸本)9781728133614

Parallel sorting algorithms for manycore CPU systems are needed in data science and big data era. The PDPSort (Parallel Dual Pivot STLSort) can be revised and extended to achieve higher and more stable Speedups. This paper experiments four scheduling algorithms, Always Left (LAL), Always Right (RAL), Longer Partition First (LPF) and Shorter Partition First (SPF). Eventually, the revised PDPSort can achieve faster Speedup by upto 7.35×, 4.83× and 4.43× over the STLSort on AMD R7-1700, AMD FX-8320, and Intel i7-2600 Linux systems, respectively. Moreover, the LPF algorithm yields more stable Speedup's than others. © 2019 IEEE.

关键词： scheduling algorithms

来源：评论

学校读者我要写书评

暂无评论

Throughput-Optimal scheduling algorithms for LLM Inference and AI Agents

arXiv

引用

arXiv 2025年

作者： Li, Yueying Dai, Jim G. Peng, Tianyi Department of Computer Science ORIE and Decision Risk and Operations CBS Cornell University Columbia University United States

As demand for Large Language Models (LLMs) and AI agents rapidly grows, optimizing systems for efficient LLM inference becomes critical. While significant efforts have targeted system-level engineering, little is explored through a mathematical modeling and queuing perspective. In this paper, we aim to develop the queuing fundamentals for LLM inference, bridging the gap between queuing and LLM system communities. In particular, we study the throughput aspect of LLM inference systems. We prove that a large class of’work-conserving’ scheduling algorithms can achieve maximum throughput for both individual requests and AI-agent workloads, highlighting’work-conserving’ as a key design principle in practice. Evaluations of real-world systems show that Orca and Sarathi-serve are throughput-optimal, reassuring practitioners, while FastTransformer and vanilla vLLM are not maximally stable and should be used with caution. Our results highlight the substantial benefits queuing community can offer in analyzing and improving LLM inference systems and call for more interdisciplinary developments. © 2025, CC BY.

关键词： scheduling algorithms

来源：评论

学校读者我要写书评

暂无评论

Comparative Analysis of Various Task scheduling algorithms in Cloud Environment

Comparative Analysis of Various Task Scheduling Algorithms i...

引用

Information Technology (OCIT), OITS International Conference on

作者： Puspanjali Mallik Ajit Kumar Nayak Rabindra Kumar Dalei Shailabala Women's Autonomous College Cuttack Sikshya O Anusandhan University Bhubaneswar Silicon Institute of Technology Bhubaneswar

ISBN: (纸本)9781665416658

Internet is indispensable in all of the activities of today's society. Cloud computing emerges as a demanded recent technology to make the use of internet in a simplified, cost-affordable and timely available form to the user. The primary purpose of cloud computing is to utilize the resource efficiently, allocate the tasks to the resources, balance their load and satisfy the agreements of user without fail. This research paper includes a brief analysis and comparison of the traditional task scheduling algorithms like FCFS, RR, and MCT with recent algorithms such as IWD, TSCSA, LBMPSO. All of the recent time algorithms are satisfying multi-objective qualities and ensures economic feasibility.

关键词： Economics Cloud computing scheduling algorithms Task analysis Information technology

来源：评论

学校读者我要写书评

暂无评论

Efficient Service Allocation scheduling algorithms for 5G User Equipments in Slice-in-Slice Networks

Efficient Service Allocation Scheduling Algorithms for 5G Us...

引用

International Symposium on Advanced Networks and Telecommunication Systems (ANTS)

作者： Sharvari Ravindran Saptarshi Chaudhuri Jyotsna Bapat Debabrata Das Networking and Communication Research Lab International Institute of Information technology Electronics City Bangalore India

ISBN: (数字)9781665448932

ISBN: (纸本)9781665448949

In 5G, network slicing is a prominent feature to provide end-to-end Quality of Experience (QoE) for specific user equipment (UE) requirements. A key technology that facilitates the enhancement of network slicing performance is Open-Radio Access Network (ORAN). The support of network slicing is an ongoing technical effort in ORAN. This paves the way for implementing challenging and predictive system control strategies to serve several UEs, leveraging UE specific aggregated data, medium access control (MAC) key performance indicators for optimizing per-UE QoE, service allocation and resource scheduling. In this paper, to improve system performance at a granular level, we propose a novel concept of formation of multiple optimized UE service specific slice-in-slice categories across network slices. There have been no clear state-of-the-art that have addressed the relationships and supportability of UEs of different services across slice-in-slice categories during service allocation in network slicing. In this paper, we propose novel Service Allocation scheduling (SAS) algorithms for UEs services. Novel multi-objective multi-constraint optimization models are formulated to achieve improved service level guarantees. A graph theoretical optimum service allocation strategy is proposed for UE services to maximize the network slice capacity. A probabilistic system resource prediction algorithm for UE services conditioned on previously occurred services is further proposed. Finally, we compared our proposed SAS with state-of-the-art service scheduling algorithms, where SAS ensures 5.12 and 6.22 times throughput gains.

关键词： scheduling algorithms 5G mobile communication Network slicing System performance Prediction algorithms Throughput Telecommunications

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：