23 papers · ranked by Valyu relevance
Yuyi Jiang, Zhiqing Shao, Yi Guo
A complex computing problem can be solved efficiently on a system with multiple computing nodes by dividing its implementation code into several parallel processing modules or tasks that can be formulated as directed acyclic graph (DAG) problems. The DAG jobs may be mapped to and scheduled on the computing nodes to…
D. Chitra Devi, V. Rhymend Uthariaraj
Cloud computing uses the concepts of scheduling and load balancing to migrate tasks to underutilized VMs for effectively sharing the resources. The scheduling of the nonpreemptive tasks in the cloud computing environment is an irrecoverable restraint and hence it has to be assigned to the most appropriate VMs at the…
Neetu Goel, Rajesh Garg
CPU scheduling has valiant effect on resource utilization as well as overall quality of the system. Round Robin algorithm performs optimally in timeshared systems, but it performs more number of context switches, larger waiting time and larger response time. The devised tool "OMDRRS" was utilized to simulate the four…
Mehrnoosh Shafiee, Javad Ghaderi
Motivated by modern parallel computing applications, we consider the problem of scheduling parallel-task jobs with heterogeneous resource requirements in a cluster of machines. Each job consists of a set of tasks that can be processed in parallel, however, the job is considered completed only when all its tasks finish…
Neetu Goel, Rajesh Garg
Developing CPU scheduling algorithms and understanding their impact in practice can be difficult and time consuming due to the need to modify and test operating system kernel code and measure the resulting performance on a consistent workload of real applications. As processor is the important resource, CPU scheduling…
Xuejun Li, Jia Xu, Yun Yang
Cloud workflow system is a kind of platform service based on cloud computing. It facilitates the automation of workflow applications. Between cloud workflow system and its counterparts, market-oriented business model is one of the most prominent factors. The optimization of task-level scheduling in cloud workflow…
Ehsan Saboori, Shahriar Mohammadi, Shafigh Parsazad
— this paper describes a new scheduling algorithm to distribute jobs in server farm systems .The proposed algorithm overcomes the starvation caused by SRPT (Shortest Remaining Processing Time). This algorithm is used in process scheduling in operating system approach . The algorithm was developed to be used in…
Nodari Vakhania, Frank Werner, Kevin Johedan Ramírez-Fuentes, Víctor Pacheco-Valencia
algorithms, complexity and approximability Authors: ['Nodari Vakhania' 'Frank Werner' 'Kevin Johedan Ramírez-Fuentes' 'Víctor Pacheco-Valencia'] Since the publication of the first scheduling paper in 1954, a huge number of works dealing with different types of single machine problems appeared. They addressed many…
Most. Fatematuz Zohora, Fahiba Farhin, M. Shamim Kaiser, Qaisar Shaheen
'Qaisar Shaheen'] Cloud computing is a popular, flexible, scalable, and cost-effective technology in the modern world that provides on-demand services dynamically. The dynamic execution of user requests and resource-sharing facilities require proper task scheduling among the available virtual machines, which is a…
Matthew Gradwohl, Guidio Sewa, Oke Blessing Oghojafor, Richard Wilouwou + 2 more
and Late Jobs in the Single Machine Flowshop Problem Authors: ['Matthew Gradwohl' 'Guidio Sewa' 'Oke Blessing Oghojafor' 'Richard Wilouwou' 'M. O. Adamu' 'Christopher Thron'] In this paper we introduce, test, and optimize two new heuristic algorithms for mixed tardiness and late job minimization in single-machine…
Ambika Aggarwal, Sunil Kumar, Ashutosh Bhatt, Mohd Asif Shah
Cloud computing is a procedure of stockpiling as well as retrieval of data or computer services over the Internet that allows all its users to remotely access the data centers. Cloud computing provides all required services to the users, but every platform has its share of pros and cons, and another major problem in…
Harshadkumar B. Prajapati, Vipul A. Shah
—Scheduling in Grid computing has been active area of research since its beginning. However, beginners find very difficult to understand related concepts due to a large learning curve of Grid computing. Thus, there is a need of concise understanding of scheduling in Grid computing area. This paper strives to present…
Authors not listed
Automated chemistry platforms hold the potential to enable large-scale organic synthesis campaigns, such as producing a library of compounds for biological evaluation. The efficiency of such platforms will depend on the schedule according to which the synthesis operations are executed. In this work, we study the…
Authors not listed
Background: Pharmaceutical batch scheduling in multi-reactor configurations presents complex optimization challenges under operational uncertainty, yet limited research addresses how parallel processing capacity affects heuristic performance and predictive modeling. Objectives: This study investigated scheduling…
Authors not listed
Background: Pharmaceutical batch production faces significant scheduling challenges due to operational uncertainties including equipment failures, yield variability, and demand fluctuations. While scheduling heuristics are widely used in practice, their comparative performance under varying uncertainty conditions…
Authors not listed
This paper presents GLAS (Git-based Lab Automated Scheduler or Get Lab Automation Simplified), an open-source, robust, and highly expandable Git-based architecture designed for laboratory automation. GLAS can be deployed in both partially and fully automated experimental science laboratories, enabling the development…
Benjamin M. David, Paul A. Jensen
Coordinating multiple liquid handling robots is a complex logistical task when designing biological experiments. Protocol designers must consider the capabilities and constraints of each robot to distribute work optimally across multiple instruments. We developed an optimization framework that finds optimal liquid…
Jaekwon Lee, Seung Yeob Shin, Shiva Nejati, Lionel C. Briand
In real-time systems, priorities assigned to real-time tasks determine the order of task executions, by relying on an underlying task scheduling policy. Assigning optimal priority values to tasks is critical to allow the tasks to complete their executions while maximizing safety margins from their specified deadlines.…
Patrick McKeever, Varun Mittal, Bryce Fukuda, Ka Yee Yeung + 1 more
The exponential growth of omics data requires novel strategies for storage, transfer, and processing of said data. We present a scheduler based on the Temporal.io workflow framework which enables two key optimizations of bioinformatics workflows. Firstly, we enable users to transparently map workflow steps to diverse…
Jamie Alnasir, Hugh P. Shanahan
The paper reviews the use of the Hadoop platform in Structural Bioinformatics applications. Specifically, we review a number of implementations using Hadoop of high-throughput analyses, e.g. ligand-protein docking and structural alignment, and their scalability in comparison with other batch schedulers and MPI. We find…
Wilfried Agbeto, Camille Coti, Vladimir Reinharz
Advances in graph algorithmics have allowed in-depth study of many natural objects from molecular biology or chemistry to social networks. Particularly in molecular biology and cheminformatics, understanding complex structures by identifying conserved sub-structures is a key milestone towards the artificial design of…
Olena Doroshenko
Pathfinding in complex topographies poses a challenge with applications extending from urban planning to autonomous navigation. While numerous algorithms offer potential solutions, their comparative efficiency and reliability when confronted with nonlinear terrains remain to be systematically evaluated. This study…
Guohao Dou
We propose an algorithm to simulate Markovian SIS epidemics with homogeneous rates and pairwise interactions on a fixed undirected graph, assuming a distributed memory model of parallel programming and limited bandwidth. We offer an implementation of the algorithm in the form of pseudocode in the Appendix. Also, we…