Filters








181,899 Hits in 4.7 sec

A parallel algorithm for optimal task assignment in distributed systems

I. Ahmad, M. Kafil
Proceedings. Advances in Parallel and Distributed Computing  
An efficient assignment of tasks to the processors is imperative for achieving a fast job turnaround time in a parallel or distributed enviornment.  ...  We propose a best-first search based parallel algorithm that generates optimal solution for assigning an arbitrary task graph to an arbitrary network of homogeneous or heterogeneous processors.  ...  We believe that to the best of our knowledge, ours is the first attempt in designing a parallel algorithm for the optimal task-to-processor assignment problem.  ... 
doi:10.1109/apdc.1997.574045 dblp:conf/apdc/AhmadK97 fatcat:hrirxzon2ff6tnspfisdiopqca

A Modified Parallel Heuristic Graph Matching Approach for Solving Task Assignment Problem in Distributed Processor System

R Mohan, N P Gopalan
2013 International Journal of Information Technology and Computer Science  
In this paper a Heuristic and Parallel Algorithm for Task Assignment Problem is proposed.  ...  Task assignment is one of the most fundamental combinatorial optimization problems.  ...  Also, a detailed description about the parallel algorithm suggested in the paper -A parallel Heuristic Graph Matching Method for Task Assignment‖ [7] , HGM Algorithm to solve the Task Assignment Problem  ... 
doi:10.5815/ijitcs.2013.10.08 fatcat:lz2fkq65qnbfhmv7r6t2xdb4ka

Performance Intensification of DRTS under Static Load Sharing Scheme

Urmani Kaushal, Avanish Kumar
2013 International Journal of Computer Applications  
Distributed Real Time System (DRTS) provides enormous platform for parallel applications. It is an alternative for highly expensive parallel machines.  ...  Task allocation for parallel applications over it, is a crucial phase where strategy for task allocation should be chosen to maximize the throughput and enhance the overall processor utilization.  ...  The algorithm discussed in this problem provide an optimal solution for assigning a set of "m" tasks of a program to a set of "n" processors (where, m > n) in a DRTS with the goal to maximize the overall  ... 
doi:10.5120/12446-9204 fatcat:trpknjeqj5hofctm3mnjny3oqu

Evaluation Performance of Task Scheduling Algorithms in Heterogeneous Environments

Hadi Yazdanpanah, Amin Shouraki, Najmeh Jamali
2016 International Journal of Computer Applications  
A heterogeneous computing environment is a large-scale distributed data processing environment, it is depends to some extent parameters on the application and that classified in three main categories such  ...  A computer system is consists of hardware and software from two or more different manufacturers.  ...  Recursive Algorithm for Scheduling of Tasks Optimal scheduling of parallel tasks is important case for achieving high performance in heterogeneous computing system, for solve this problem, Kang and Lin  ... 
doi:10.5120/ijca2016908968 fatcat:pg6ufigyerajhnzronxfmtqodu

Qualitative Parametric Comparison Of Load Balancing Algorithms In Parallel And Distributed Computing Environment

Amit Chhabra, Gurvinder Singh, Sandeep Singh Waraich, Bhavneet Sidhu, Gaurav Kumar
2008 Zenodo  
One of the biggest issues in such systems is the development of effective techniques/algorithms for the distribution of the processes/load of a parallel program on multiple hosts to achieve goal(s) such  ...  Decrease in hardware costs and advances in computer networking technologies have led to increased interest in the use of large-scale parallel and distributed computing systems.  ...  In such type of applications, a large process/task is divided and then distributed among multiple hosts for parallel computation.  ... 
doi:10.5281/zenodo.1059751 fatcat:nswd2a2q3bgcjgzweptk6obynm

Optimal task assignment in heterogeneous distributed computing systems

M. Kafil, I. Ahmad
1998 IEEE Concurrency  
The first is a sequential algorithm that reduces the search space. The second proposes to lower time complexity, by running the assignment algorithm in parallel, and achieves significant speedup.  ...  A distributed system comprising networked heterogeneous processors requires efficient task-to-processor assignment to achieve fast turnaround time.  ...  We also thank Vipin Kumar for useful discussions and suggestions. The Hong Kong Research Grants Council under contract numbers HKUST 734/96E and HKUST 6076/97E funded this research.  ... 
doi:10.1109/4434.708255 fatcat:bcitoncpcnfsnb5j5wwq4cgqya

Optimal Task Partitioning Model in Distributed Heterogeneous Parallel Computing Environment

Javed Ali
2012 International Journal of Advanced Information Technology  
Some important model [4] for task partitioning in parallel computing system are: PRAM ,BSP etc.DAG is a well known representation of parallel applications in which nodes represents the tasks and edges  ...  Parallel computing systems compose task partitioning strategies in a true multiprocessing manner.  ...  PROPOSED MODEL FOR TASK PARTITIONING IN DISTRIBUTED ENVIRONMENT SCHEDULING: Task partitioning strategy in parallel computing system is the key factor to decide the efficiency, speedup of the parallel computing  ... 
doi:10.5121/ijait.2012.2602 fatcat:fvlirr2ua5cxnbhgcpcvd7bosu

An Empirical Study and Analysis of the Dynamic Load Balancing Techniques Used in Parallel Computing Systems [article]

Ardhendu Mandal, Subhas Chandra Pal
2011 arXiv   pre-print
This paper explains only the different dynamic load balancing techniques in brief used in parallel systems and concluding with the comparative performance analysis result of these algorithms.  ...  Hence, load balancing on parallel systems is a critical and challenging activity. Load balancing algorithms can be broadly categorized as static or dynamic.  ...  F., and Paturi, R., Program Speedup in a Heterogeneous Computing Network, Journal of Parallel and Distributed Computing, 21, 3, 316-322, (6/1994). [2] Leopold, C., Parallel and Distributed Computing.  ... 
arXiv:1109.1650v1 fatcat:3zggyk37ifgrnbbrbfi2zrpvpq

Load balancing strategy for multicore systems

E. Chovancova, J. Mihal'ov
2015 2015 13th International Conference on Emerging eLearning Technologies and Applications (ICETA)  
High performance computing including parallel and distributing systems now focus on power efficient execution.  ...  Soft-wares are written for multicore platform that distribute the workload amongst multiple identical or different cores. This functionality is called thread-level parallelism.  ...  ACKNOWLEDGMENT The work is supported by iFuture: A Leading Research Group in Department of Computer Science, Abdul Wali Khan University, Mardan. The authors are thankful to Miss.  ... 
doi:10.1109/iceta.2015.7558473 fatcat:ffoxzd7j6jc4loehhunoppfhwe

A distributed auction algorithm for the assignment problem

Michael M. Zavlanos, Leonid Spesivtsev, George J. Pappas
2008 2008 47th IEEE Conference on Decision and Control  
We address this challenge by means of a distributed auction algorithm, where the agents are able to bid for the task to which they wish to be assigned.  ...  maximizes the total assignment benefit within a linear approximation of the optimal one.  ...  In Section II we define the linear assignment problem in the context of networked systems, while in Section III we propose a distributed auction algorithm for the assignment problem and discuss its convergence  ... 
doi:10.1109/cdc.2008.4739098 dblp:conf/cdc/ZavlanosSP08 fatcat:j5zhrpe5dja3rhwst7a6yh67i4

Studying the impact of synchronization frequency on scheduling tasks with dependencies in heterogeneous systems

F.M. Ciorba, I. Riakiotakis, G. Papakonstantinou, T. Andronikos, A.T. Chronopoulos
2007 Parallel Architecture and Compilation Techniques (PACT), Proceedings of the International Conference on  
We propose a theoretical model that results in a function that estimates the parallel time of tasks in loops with dependencies on heterogeneous systems.  ...  Many scheduling algorithms have been devised for nested loops with and without dependencies on general heterogeneous distributed systems ([1] and references therein).  ...  We propose a theoretical model that results in a function that estimates the parallel time of tasks in loops with dependencies on heterogeneous systems.  ... 
doi:10.1109/pact.2007.4336231 fatcat:vxbhfaeph5dkheshu42lug7ere

Studying the impact of synchronization frequency on scheduling tasks with dependencies in heterogeneous systems

Theodore Andronikos, Florina M. Ciorba, Ioannis Riakiotakis, George Papakonstantinou, Anthony T. Chronopoulos
2010 Performance evaluation (Print)  
We propose a theoretical model that results in a function that estimates the parallel time of tasks in loops with dependencies on heterogeneous systems.  ...  Many scheduling algorithms have been devised for nested loops with and without dependencies on general heterogeneous distributed systems ([1] and references therein).  ...  We propose a theoretical model that results in a function that estimates the parallel time of tasks in loops with dependencies on heterogeneous systems.  ... 
doi:10.1016/j.peva.2010.08.020 fatcat:a5mvnm76mngkjngttounid6jd4

A Survey of Static Scheduling Algorithm for Distributed Computing System

Khushboo Singh, Mahfooz Alam, Sushil Kumar
2015 International Journal of Computer Applications  
In this paper we are discussing various static scheduling algorithm and numerous problems in various levels of the homogeneous and heterogeneous distributed systems.  ...  In such systems, purpose of scheduling algorithm is to allocate tasks to available processor so as to efficiently utilize this processor and to reduce the makespan, total computational cost and various  ...  Prof. of CSE Institute of Technology & Management, Aligarh for his constant support. Author is also very special thankful to his friend (Mr. Mahfooz Alam).  ... 
doi:10.5120/ijca2015906828 fatcat:kta7shcu5nbejc73tiju4iw2we

Parallelization of Array Method with Hybrid Programming: OpenMP and MPI

Apolinar Velarde Martínez
2022 Applied Sciences  
For parallelization of applications with high processing times and large amounts of storage in High Performance Computing (HPC) systems, shared memory programming and distributed memory programming have  ...  subtasks to be assigned in the same clusters or in cluster neighbors and, finally, the searches for free resources are executed in different geographically distributed clusters, not sequentially.  ...  Acknowledgments: Special thanks to Instituto Tecnológico el Llano Aguascalientes for administrative and technical support. Conflicts of Interest: The author declares no conflict of interest.  ... 
doi:10.3390/app12157706 fatcat:jzqnahir4vfkvfod7hrrtaesym

Data Flow Modelling for Effective Protection of Electronic Health Records (EHRs) in Cloud
english

V.M.Prabha karan, Prof.S.Bala murugan, S.Char anyaa
2015 International Journal of Innovative Research in Computer and Communication Engineering  
MyPHRMachines a patient centric system that takes a radically new architectural solution to health record interoperability.  ...  Finally we illustrate how a prototype of MyPHRMachines supports the use case of a real world patient.  ...  Reng-Yang et-al [22] proposed a hybrid particle swarm optimization algorithm with Hillchmbing heuristic as the local search method for optimal task assignment in distributed system. P.  ... 
doi:10.15680/ijircce.2015.0301025 fatcat:hzfqzzmujjc5posikcxerqb3kq
« Previous Showing results 1 — 15 out of 181,899 results