Filters








71,669 Hits in 7.4 sec

Algorithm 40: critical path scheduling

B. Leavenworth
1961 Communications of the ACM  
{z] is the square matrix of the correlation coefficients of the initial observation matrix [x ALGORITHM 40 CRITICAL PATH SCHEDULING B.  ...  Wacker, “‘Critical- Path Planning and Scheduling,’’ 1959 Proceedings of the Eastern Joint Computer Conference. 2) M. C.  ... 
doi:10.1145/366199.366271 fatcat:l6amrj3e4vcq7dt5cxcdvblaza

Certification of algorithm 40: critical path scheduling

Neal L. Alexander
1961 Communications of the ACM  
40 CRITICAL PATH SCHEDULING (B.  ...  ALEXANDER Union Carbide Olefins West Virginia Company, South Charleston, The Critical Path Scheduling algorithm was coded in ForTRAN for the IBM 7070.  ... 
doi:10.1145/366696.366765 fatcat:i5iz5xgsjzh57ek2gg33yei6c4

Critical-path planning and scheduling

James E. Kelley, Morgan R. Walker
1959 Papers presented at the December 1-3, 1959, eastern joint IRE-AIEE-ACM computer conference on - IRE-AIEE-ACM '59 (Eastern)  
In order to prepare the way, the team was given a 40-hour workshop course on the Critical-Path Method.  ...  Walker: Once you have a critical path and you wish to compress the schedule you are going to add more critical paths. One is not going to drop out entirely from the picture.  ... 
doi:10.1145/1460299.1460318 fatcat:xjiiyw5xjjgkfkgrgwpwjwcjka

A Dynamic Critical Path Algorithm for Scheduling Scientific Workflow Applications on Global Grids

Mustafizur Rahman, Srikumar Venugopal, Rajkumar Buyya
2007 Third IEEE International Conference on e-Science and Grid Computing (e-Science 2007)  
In this paper, we propose a Dynamic Critical Path (DCP) based workflow scheduling algorithm that determines efficient mapping of tasks by calculating the critical path in the workflow task graph at every  ...  It assigns priority to a task in the critical path which is estimated to complete earlier.  ...  Kwok and Ahmad [6] introduced the Dynamic Critical Path (DCP) algorithm in which the critical path is dynamically determined after each task is scheduled.  ... 
doi:10.1109/e-science.2007.3 dblp:conf/eScience/RahmanVB07 fatcat:rz2dwev25vdczl6suuw7ore44i

Critical Path Scheduling with Resource and Processor Constraints

Errol L. Lloyd
1982 Journal of the ACM  
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  ...  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  ...  A Coffman-Graham schedule is a special type of critical path schedule.  ... 
doi:10.1145/322326.322336 fatcat:iyr3qjtalje3tlicgm6zrtpfva

Profiling the scheduling decisions for handling critical paths in deadline-constrained cloud workflows

Arie Taal, Junchao Wang, Cees de Laat, Zhiming Zhao
2019 Future generations computer systems  
[10] presented a scheduling algorithm based on the Partial Critical Path method (IC-PCP). Based on the IC-PCP algorithm Shi et al.  ...  Greediness of the IC-PCP algorithm Applying a critical path-based algorithm is a widely used approach for tackling the multi-processor scheduling problem [33] .  ...  He coordinates research effort on quality critical systems on programmable infrastructures in the context of European H2020 projects of SWTICH, ENVRIPLUS and VRE4EIC.  ... 
doi:10.1016/j.future.2019.05.002 fatcat:xtrhi2i4ifeqpbcfmu76idlgjm

Critical path and area based scheduling of parallel task graphs on heterogeneous platforms

T. N'Takpe, F. Suter
2006 12th International Conference on Parallel and Distributed Systems - (ICPADS'06)  
In this paper we address the need for scheduling techniques for parallel task applications for heterogeneous clusters of clusters by proposing a method to adapt existing parallel task graphs scheduling  ...  While most parallel task graphs scheduling research has been done in the context of single homogeneous clusters, heterogeneous platforms have become prevalent and are extremely attractive for deploying  ...  CPA For the work described in this paper we focused on [7] which describes a parallel task scheduling algorithms for homogeneous environments named CPA (Critical Path and Area-based scheduling).  ... 
doi:10.1109/icpads.2006.32 dblp:conf/icpads/NTakpeS06 fatcat:t6qb7hy3ibat3lnmasrhlfuw7q

Iterative Dynamic Critical Path Scheduling: An Efficient Technique for Offloading Task Graphs in Mobile Edge Computing

Bo Xu, Yi Hu, Menglan Hu, Feng Liu, Kai Peng, Lan Liu
2022 Applied Sciences  
To this end, we propose a novel offloading algorithm, referred to as Iterative Dynamic Critical Path Scheduling (IDCP).  ...  IDCP minimizes the makespan by iteratively migrating tasks to keep shortening the dynamic critical path.  ...  To reduce the time complexity of the algorithm, we randomly select nodes from the critical path for scheduling.  ... 
doi:10.3390/app12063189 fatcat:bzwucaauqvevzgunhfkbs3jcay

Critical-Path Aware Scheduling for Latency Efficient Broadcast in Duty-Cycled Wireless Sensor Networks

Duc-Tai Le, Giyeol Im, Thang Le Duc, Vyacheslav V. Zalyubovskiy, Dongsoo S. Kim, Hyunseung Choo
2018 Wireless Communications and Mobile Computing  
To facilitate the broadcast latency minimization, we propose a novel approach, critical-path aware scheduling (CAS), which schedules transmissions with a preference of nodes in critical paths of a duty-cycled  ...  Such collision-preventions result in extra delays for a broadcast and may increase overall latency if the delays occur along critical paths of the network.  ...  Critical-Path Aware Scheduling. In this section, we present two broadcast scheduling schemes employing the critical-path aware scheduling (CAS) to reduce broadcast latency.  ... 
doi:10.1155/2018/5017319 fatcat:5buzbjstpfawpluj62xspr52aa

TOPOSCH: Latency-Aware Scheduling Based on Critical Path Analysis on Shared YARN Clusters

Chunming Hu, Jianyong Zhu, Renyu Yang, Hao Peng, Tianyu Wo, Shiqing Xue, Xiaoqiang Yu, Jie Xu, Rajiv Ranjan
2020 2020 IEEE 13th International Conference on Cloud Computing (CLOUD)  
A latency graph is periodically generated for identifying victim microservices through an end-to-end latency critical path analysis.  ...  We then exploit per-microservice and pernode risk assessment to gauge the visible resources to the capacity scheduler in YARN.  ...  [40] [41] infer the execution path of the application based on the static analysis and symbolic execution.  ... 
doi:10.1109/cloud49709.2020.00091 fatcat:tnodzbk3cvf4higz5j73all4lu

Games, Critical Paths and Assignment Problems in Permutation Flow Shops and Cyclic Scheduling Flow Line Environments

Selcuk Karabati, Panagiotis Kouvelis, Ali S. Kiran
1992 Journal of the Operational Research Society  
Let CP: S, > T,,,, be such that CP (co) = 7, where 7 is the critical path of schedule o.  ...  The makespan calculations (critical paths) for these schedules give us new upper bounds.  ... 
doi:10.1057/jors.1992.33 fatcat:aj527bsjt5gz3jyc6xso77enqu

Integration of Building Information Modeling and Critical Path Method Schedules to Simulate the Impact of Temperature and Humidity at the Project Level

Yongwei Shan, Paul Goodrum
2014 Buildings  
This research is built on the existing body of knowledge and develops a framework of integrating building information modeling (BIM) with a lower level critical path method (CPM) schedule to simulate the  ...  Among the climatic factors, temperature and humidity are two of the most critical factors [4] that influence craft workers' productivity, since they exist ubiquitously and exert their effect on craft workers  ...  path method (CPM) schedule analysis.  ... 
doi:10.3390/buildings4030295 fatcat:gvq7ddiewbh3fbhqjctkz7midi

Randomized Priority Algorithms [chapter]

Spyros Angelopoulos
2004 Lecture Notes in Computer Science  
As case studies, we prove inapproximation results for two well-studied optimization problems, namely facility location and makespan scheduling.  ...  Borodin, Nielsen and Rackoff [13] introduced the class of priority algorithms as a framework for modeling deterministic greedy-like algorithms.  ...  More specifically, we do not know whether the knowledge of the size of the input is critical in the context of makespan scheduling.  ... 
doi:10.1007/978-3-540-24592-6_3 fatcat:37sglg3xyvbtjgarntu5w7n33y

Scheduling and routing algorithms for AGVs: A survey

Ling Qiu, Wen-Jing Hsu, Shell-Ying Huang, Han Wang
2002 International Journal of Production Research  
As one of the enabling technologies, scheduling and routing of AGVs have attracted considerable attention. Many algorithms for the scheduling and routing of AGVs have been proposed.  ...  resources (e.g. path, loading and unloading bu ers) among AGVs.  ...  The proposed micro-opportunistic scheduling algorithm (MOSA) combines two perspectives, namely job-and vehicle-based approaches, into a single algorithm, in which both the critical jobs and the travel  ... 
doi:10.1080/00207540110091712 fatcat:5jkb4ilq55adfcuugl56n2n22m

Algorithms [chapter]

2011 Graph Coloring Problems  
Jaeger's Circular Flow Conjecture Berge's Strong Path Partition Conjecture Berge's Directed Path-Conjecture Minimal Orientations of Critical Graphs Alon-Tarsi Orientations and Chromatic Number Bibliography  ...  Degree 5 Problem 101 5.6 Large Critical Subgraphs of Critical Graphs 102 5.7 Critical Subgraph Covering a 2-Path 102 5.8 Noninduced Critical Subgraphs 103 5.9 Number of Critical Subgraphs  ... 
doi:10.1002/9781118032497.ch10 fatcat:374tktuvgvekni4fnz3dgbytjm
« Previous Showing results 1 — 15 out of 71,669 results