In this paper, we present an algorithm for determining the entry fix arrival times in metroplex like airspace configurations that minimizes the vectoring within the terminal area. We then discusses two generic aispace...
详细信息
This article presents a detailed discussion of LRE-TL (Local Remaining Execution-TL-plane), an algorithm that schedules hard real-time periodic and sporadic task sets with unconstrained deadlines on identical multipro...
详细信息
Real-time applications of future IT will continue to drive the demand for performance scaling in devices ranging from sensors to servers. Parallel processing in the form of mul-ticore and manycore architectures will a...
详细信息
This is an analysis of the problem of minimizing the total weighted completion time for jobs of the same processing time on a single machine, given the arrival times of the jobs and the possibility of preemption. At p...
详细信息
We present distributed query scheduling algorithms that minimize network utilization for spatial joins in the SkyQuery federation of Astronomy databases. Unlike existing works that measure the quality of join schedule...
详细信息
Time-triggered Distributed Integrated Modular Avionics (DIMA) system has its unique time-triggered(TT) traffic schedule to guarantee the determinacy of time-critical message. In this paper we consider the "hunger...
详细信息
ISBN:
(数字)9781728162836
ISBN:
(纸本)9781728162843
Time-triggered Distributed Integrated Modular Avionics (DIMA) system has its unique time-triggered(TT) traffic schedule to guarantee the determinacy of time-critical message. In this paper we consider the "hunger problem" of the rate-constrained(RC) traffic due to centralized scheduling of the TT traffic under the traditional partition scheduling model in DIMA. We propose a MNP(Maximize the Number of Porosity) TT-schedule algorithm, in which the TT frames will be dispersed and scheduled using a porous scheduling model, providing more porosity in time domain for the subsequent RC traffic. Further, since the traditional performance analysis models based on the network calculus approach are not fit for our system due to the porosity characteristic of the TT traffic in the TT-schedule, we introduce a porosity concept to the arrival curve model of the TT traffic and analyze the performance of our algorithm. Experiments show that the new algorithm gives lower latency than the results from partition scheduling, which verifies the feasibility and superiority of the proposed algorithm.
Modern embedded platforms contain a variety of physical resources, such as caches, interconnects, main memory, etc., which the processor must access during the execution of a task. We argue that processor task executi...
详细信息
Modern embedded platforms contain a variety of physical resources, such as caches, interconnects, main memory, etc., which the processor must access during the execution of a task. We argue that processor task execution and accesses to physical resources should be co-scheduled in real-time systems to predictably hide resource access latency. In particular, in this work we focus on co-scheduling task execution and accesses to main memory to hide DRAM access latency. Since modern systems implement DMA controllers that can be operated independently of processor execution, this allows us to hide memory transfer latency by scheduling DMA transfer in parallel with processor execution. The main contribution of this paper is a dynamic scheduling algorithm for a set of sporadic real-time tasks that efficiently co-schedules processor and DMA execution to hide memory transfer latency. The proposed algorithm can be applied to either uniprocessor or partitioned multiprocessor systems. We demonstrate that we improve processor utilization significantly compared to existing scratchpad and cache management systems.
User's demand for faster response on services over cloud is increasing day by day. Fog and Edge computing are trending solutions to response time problems in cloud. These technologies when added to cloud, can dras...
详细信息
ISBN:
(数字)9781665419178
ISBN:
(纸本)9781665430272
User's demand for faster response on services over cloud is increasing day by day. Fog and Edge computing are trending solutions to response time problems in cloud. These technologies when added to cloud, can drastically improve the performance. But as every technology has some limitations, they also suffer problems like- limited resources. scheduling of tasks over limited resource is one of the major research challenges of these areas. Hence in this paper, we are proposing Makespan and Load sensitive workflow scheduling algorithm based on Max-Min technique which aims to minimize the makespan, energy and cost, keeping in view the distribution of load among servers in Cloud-Fog-Edge environment. This approach gives workflow scheduling with minimum makespan and less energy consumption. Percentage change obtained for makespan is 46.78%, 47.3%, and 11.59%; energy is 32.92%, 33.39%, and 6.83% as compared to Min-Min, Max-Min and ELBMM correspondingly for 100 tasks. The result signifies that our proposed approach performs better as compared to others.
The increasing scale of multi-core processors are likely to be randomly heterogeneous by design or because of diversity and flaws. The latter type of heterogeneity introduced by some unforeseen variable factors such a...
详细信息
ISBN:
(纸本)9781509040940
The increasing scale of multi-core processors are likely to be randomly heterogeneous by design or because of diversity and flaws. The latter type of heterogeneity introduced by some unforeseen variable factors such as the manufacturing process variation is especially challenging because of its unpredictability. In this environment, thread scheduler and global power manager must handle such randomly heterogeneous. Furthermore, these algorithms must supply high efficiency, scalability and low overhead because future multi-core processors may have a number of cores on a single die. This paper presents a variation-aware scheduling algorithm for application scheduling and power management. Thread switching and sampling among different cores in the multi-core processor introduce obvious overhead than previous many-core scheduling algorithms. Proposed scheme records the information of swapped thread of preferential core and uses tabu search-based randomly heterogeneous scheduling algorithm(TSR) to avoid the occurrence of repeated sampling and reduce the migration frequency and sampling frequency of a thread. The experimental results show that TSR algorithm has decreased 45.7% of thread migration and 42.2% of the sampling time as compared with local search algorithm. This paper regards the transcendental Hungarian offline scheduling algorithm as the baseline. ED2 of TSR only decrease by 8.58% as compared with that of Hungarian offline scheduling algorithm, but compared with the random search scheduling algorithm, ED2 of TSR decreased by 39.4%.
Recent static timing analysis (STA) engines have leveraged task dependency graph (TDG) parallelism to accelerate various STA algorithms, including graph-based analysis and path-based analysis. Despite the promising sp...
详细信息
暂无评论