Filters








72 Hits in 4.5 sec

Critical Path Scheduling with Resource and Processor Constraints

Errol L. Lloyd
1982 Journal of the ACM  
An investigation IS made of the worst-case performance of two related algorithms for scheduhng umt-execut~on-ume task systems w~th resources Unhke most prewous scheduhng results for task systems w~th resources  ...  This assumption has both practical and theoreucal interest An upper bound is gwen for the worst-case performance of critical path scheduhng for these task systems This bound depends on both the number  ...  Ron Rivest has provided a number of suggestions which have greatly improved this paper over earher versions. In addition, the referees pointed out several errors in the paper as originally submitted.  ... 
doi:10.1145/322326.322336 fatcat:iyr3qjtalje3tlicgm6zrtpfva

Inapproximability and Polynomial-Time Approximation Algorithm for UET Tasks on Structured Processor Networks

M. Bouznif, R. Giroudeau
2011 Advances in Operations Research  
We then prove that there is no heuristic with a performance guarantee smaller than 4/3 for makespan minimization for precedence graph on a large class of processor networks like hypercube, grid, torus,  ...  We investigate complexity and approximation results on a processor networks where the communication delay depends on the distance between the processors performing tasks.  ...  a list scheduling in which no order on tasks is specified.  ... 
doi:10.1155/2011/476939 fatcat:7jb4upsztjatpldoseurtxs4qm

Page 705 of Mathematical Reviews Vol. , Issue 81B [page]

1981 Mathematical Reviews  
-T. 81b:68040 Bounds on list scheduling of UET tasks with restricted resource constraints. Inform. Process. Lett. 9 (1979), no. 4, 167-170.  ...  The problem is to obtain a minimal-length, nonpreemptive schedule for 7, where the length of a schedule is the time taken to execute all tasks in T subject to the precedence and resource constraints.  ... 

SCHEDULING INTERVAL ORDERS IN PARALLEL

ERNST W. MAYR
1996 Parallel Algorithms and Applications  
For a given interval order with n tasks, these scheduling distances can be computed using n3 processors and O(log'n) time on a CREW-PRAM.  ...  Our algorithm is based on a subroutine for computing so-called scheduling distances, i.e., the minimal number of time steps needed to schedule all those tasks succeeding some given task t and preceding  ...  An rn-processor schedule for a UET task system (T, +), with T = (21,.  ... 
doi:10.1080/10637199608915542 fatcat:44kfxde36newrivviuupsznmxe

List schedules for cyclic scheduling

Philippe Chrétienne
1999 Discrete Applied Mathematics  
The cyclic scheduling problem CSP A scheduling problem is cyclic if the set of tasks, the set of precedence constraints and the set of resource constraints have a periodic structure.  ...  This paper adresses the definition and properties of list scheduling in the context of scheduling a cyclic set of n non-preemptive and non-reentrant-dependent tasks on m identical processors when the reduced  ...  The perfortnance bound essentially relies on a comparison between two schedules of the (finite) task graph G,,: the first is S,,, the restriction of S to G,,, and the second is I,,, the list schedule we  ... 
doi:10.1016/s0166-218x(99)00017-7 fatcat:pjm27vfo3ff2jltyjzuwm7blcu

Scheduling with Communication Delays [chapter]

R. Giroudeau, J.C. Koenig
2007 Multiprocessor Scheduling, Theory and Applications  
Scheduling theory is concerned with the optimal allocation of scarce resources to activities over time.  ...  With the increasing importance of parallel computing, the question of how to schedule a set of tasks on a given architecture becomes critical, and has received much attention.  ...  If we consider the problem of scheduling a precedence graph with large communication delays and unit execution time (UET-LCT), on a restricted number of processors, Bampis et al. in (Bampis et al., 1996  ... 
doi:10.5772/5215 fatcat:3cnyrr6ykrespe7dj4sue6f7e4

Sensor measurement scheduling: an enhanced dynamic, preemptive algorithm

Gregory A. McIntyre
1998 Optical Engineering: The Journal of SPIE  
One of the key components of OGUPSA is the information in the applicable sensor table. This table is the mechanism that is used to assign requested tasks to specific sensors.  ...  the measurement requests along with their priorities and optimally maps them to a set of sensors.  ...  The sensor scheduling problem is one of how to effectively assign a set of measurement tasks to a set of sensors with some constraints.  ... 
doi:10.1117/1.601640 fatcat:2pbkby5ecvd3lhdawz3r26th4u

Approximation algorithms for scheduling with a limited number of communications

Chams Lahlou
2000 Parallel Computing  
We consider the case of a UET tree and an unlimited number of processors.  ...  Finally, we compare our 6-approximation algorithm with other algorithms by simulations.  ...  The Connection between UET-bound and UET-UCT-bus A schedule for a precedence graph G = (V, E), in the model UET-bound, assigns a starting time t i and a unique processor π i to each task i of V such that  ... 
doi:10.1016/s0167-8191(00)00032-6 fatcat:kl4sivkuqbee3knaaqdbvaexpm

Efficiency of equilibria in restricted uniform machine scheduling with total weighted completion time as social cost

José R. Correa, Maurice Queyranne
2012 Naval Research Logistics  
From a classical machine scheduling perspective, our results establish the same constant performance guarantees for WSPT list scheduling.  ...  In our setting, jobs are processed on restricted uniform parallel machines, where each machine has a speed and is only capable of processing a subset of jobs; a job's cost is its weighted completion time  ...  They also thank Christoph and Martín Matamala for stimulating discussions on the material in section 3, and Yossi Azar for pointing out reference [10] .  ... 
doi:10.1002/nav.21497 fatcat:3idnxel5gjcvnoxsyluufd6u3a

On-line scheduling of parallel jobs with runtime restrictions

Stefan Bischof, Ernst W. Mayr
2001 Theoretical Computer Science  
Consider the execution of a parallel application that dynamically generates parallel jobs with speciÿed resource requirements during its execution.  ...  on the runtime ratio of all generated jobs.  ...  Acknowledgements We would like to thank Klaus Jansen for helpful suggestions for the analysis of the LEVEL(FF) algorithm, and JiÄ rà Sgall and an anonymous referee for their valuable comments.  ... 
doi:10.1016/s0304-3975(00)00260-7 fatcat:bohibnemzfcrxbxbr2mhpojnuy

Dependency Graph Approach for Multiprocessor Real-Time Synchronization [article]

Jian-Jia Chen and Georg von der Brüggen and Junjie Shi and Niklas Uete
2018 arXiv   pre-print
However, the performance of these protocols highly depends on how the tasks are partitioned and prioritized and how the resources are shared locally and globally.  ...  We present a series of algorithms with speedup factors between 2 and 3 under semi-partitioned scheduling.  ...  For one evaluation point, 100 synthetic task sets were generated and tested.  ... 
arXiv:1809.02892v1 fatcat:ih3f5h6v7vbh3liq43uajrcv7m

An optimal instruction scheduler for superscalar processor

Hong-Chich Chou, Chung-Ping Chung
1995 IEEE Transactions on Parallel and Distributed Systems  
Superscalar instructions are typed and may induce delay cycles in terms of result availability. These two features are not seen in UET task scheduling.  ...  The success of superscalar machines depends not only on the vast hardware resources they provide, but even more importantly, on how efficiently these resources are used.  ...  The constraints on type and delay in Definition 3) through Definition 6) are thus unnecessary for UET task scheduling.  ... 
doi:10.1109/71.372778 fatcat:ighs6xqgw5hudksfyoakcevzju

Efficient approximation algorithms for scheduling malleable tasks

Gregory Mounie, Christophe Rapine, Dennis Trystram
1999 Proceedings of the eleventh annual ACM symposium on Parallel algorithms and architectures - SPAA '99  
In this paper, we are interested in scheduling a set of ' independent malleable tasks on a multiprocessor system composed by to describe the list scheduling approach and its performance analysis.  ...  of resources allotted to it.  ...  Graham & Johnson [6] proved a general performance guarantee of ) for any list scheduling algorithm for a set of independent tasks sharing different resources.  ... 
doi:10.1145/305619.305622 dblp:conf/spaa/MounieRT99 fatcat:dhpju7znwrcwdhckowhytzyi5a

Reference List of Indexed Articles

2001 Information Processing Letters  
Leung, Bounds on list scheduling of UET tasks with restricted resource constraints 9 (4) (1979) 167-170 505. E.J. Cockayne, F. Ruskey and A.G.  ...  Lloyd, List scheduling bounds for UET systems with resources 10 (1) (1980) 28-31 528. C.  ... 
doi:10.1016/s0020-0190(01)00177-6 fatcat:vksyqyokdzdztflaez5hlnchxy

Performance Evaluation of Application Mapping Approaches for Network-on-Chip Designs

Waqar Amin, Fawad Hussain, Sheraz Anjum, Sarzamin Khan, Naveed Khan Baloch, Zulqar Nain, Sung Won Kim
2020 IEEE Access  
The dependency on multi-core systems to accomplish the highperformance constraints of composite embedded applications is on the rise.  ...  This paper presents the detailed comparative analysis and categorization of application mapping approaches with current trends in NoC design implementation.  ...  tasks with dependencies to the same resource node.  ... 
doi:10.1109/access.2020.2982675 fatcat:kn6mkit3uvguvc2w6lx5dgddoe
« Previous Showing results 1 — 15 out of 72 results