Results 251 to 260 of about 1,093,881 (295)
Some of the next articles are maybe not open access.
Q-learning for Statically Scheduling DAGs
2020 IEEE International Conference on Big Data (Big Data), 2020Data parallel frameworks (e.g. Hive, Spark or Tez) can be used to execute complex data analyses consisting of many dependent tasks represented by a Directed Acylical Graph (DAG). Minimising the job completion time (i.e. makespan) is still an open problem for large graphs.We propose a novel deep Q-learning (DQN) approach to statically scheduling DAGs ...
Roeder, J., Rouxel, B., Grelck, C.
openaire +3 more sources
Rate-optimal scheduling for cyclo-static and periodic schedules
1995 International Conference on Acoustics, Speech, and Signal Processing, 2002In order to realize DSP applications on multiprocessor systems with the optimal throughput, the properties and efficient techniques need to be derived. Rate-optimal scheduling with minimum unfolding has been studied in the past for static schedules only.
Liang-Fang Chao, Edwin Hsing-Mean Sha
openaire +1 more source
Static-priority periodic scheduling on multiprocessors
Proceedings 21st IEEE Real-Time Systems Symposium, 2002Presents a new sufficient condition for the schedulability of preemptable, periodic, hard-real-time task sets using the very simple static-priority weight-monotonic scheduling scheme. Like a previous condition due to S. Baruah et al. (1996), our condition actually determines pfair schedulability.
Srikanth Rarnarnurthy, Mark Moir
openaire +1 more source
2007
DVFS processors, if used properly, can dramatically reduce the energy consumption of real-time systems employing such processors. In this chapter, two static or off-line, voltage/frequency selection techniques are presented to maximally exploit the energy-saving benefit provided by DVFS processors. The first technique targets a popular dynamic-priority
Gang Quan, Xiaobo Sharon Hu
openaire +1 more source
DVFS processors, if used properly, can dramatically reduce the energy consumption of real-time systems employing such processors. In this chapter, two static or off-line, voltage/frequency selection techniques are presented to maximally exploit the energy-saving benefit provided by DVFS processors. The first technique targets a popular dynamic-priority
Gang Quan, Xiaobo Sharon Hu
openaire +1 more source
1993
In this chapter we will consider scheduling tasks on dedicated processors (machines). As we said in Section 3.1 we assume that tasks form n subsets (or jobs), belonging to set J, and two adjacent tasks of a job are to be performed on different machines.
Jacek Blazewicz +3 more
openaire +1 more source
In this chapter we will consider scheduling tasks on dedicated processors (machines). As we said in Section 3.1 we assume that tasks form n subsets (or jobs), belonging to set J, and two adjacent tasks of a job are to be performed on different machines.
Jacek Blazewicz +3 more
openaire +1 more source
Unified Static Scheduling on Various Models
1993 International Conference on Parallel Processing - ICPP'93 Vol2, 1993Given a behavioral description of an algorithm represented by a data-flow graph, we show how to obtain a rote-optimal static schedule with the minimum unfolding factor under two timing models, integral grid model and fractional grid model, and two design styles for each model, pipelined design and non-piplined design.
Liang-Fang Chao, Edwin Hsing-Mean Sha
openaire +1 more source
Quasi-static scheduling for safe futures
Proceedings of the 13th ACM SIGPLAN Symposium on Principles and practice of parallel programming, 2008Migrating sequential programs to effectively utilize next generation multicore architectures is a key challenge facing application developers and implementors. Languages like Java that support complex control- and dataflow abstractions confound classical automatic parallelization techniques. On the other hand, introducing multithreading and concurrency
Armand Navabi +2 more
openaire +2 more sources
Static-priority scheduling of multiframe tasks
Proceedings of 11th Euromicro Conference on Real-Time Systems. Euromicro RTS'99, 2003The multiframe model of hard-real-time tasks is a generalization of the well-known periodic task model of C. Liu and J. Layland (1973). The feasibility analysis of systems of multiframe tasks which are assigned priorities according to the rate-monotonic priority assignment scheme is studied.
Sanjoy K. Baruah +2 more
openaire +2 more sources
A static workload balance scheduling algorithm
Proceedings. International Conference on Parallel Processing Workshop, 2003This article studies a static scheduling method based on workload balancing. An equation is presented for the case when the workload is equally distributed onto all the processors. An efficient load balance scheduling algorithm is developed assuming that the workload has certain properties.
Tatiana Tabirca +3 more
openaire +2 more sources
Static scheduling of uniform nested loops
[1993] Proceedings Seventh International Parallel Processing Symposium, 2002Efficient scheduling of nested loops is an important problem in highly parallel systems. Most of previous research has been on the transformations of iteration space instead of the loop body. The authors introduce a methodology to transform a loop body into a new one with a better schedule.
Liang-Fang Chao, Edwin Hsing-Mean Sha
openaire +2 more sources