2019
DOI: 10.4018/ijertcs.2019040105
|View full text |Cite
|
Sign up to set email alerts
|

Implementation and Comparative Analysis of k-means and Fuzzy c-means Clustering Algorithms for Tasks Allocation in Distributed Real Time System

Abstract: Distributing tasks to processors in distributed real time systems is an important step for obtaining high performance. Scheduling algorithms play a vital role in achieving better performance and high throughput in heterogeneous distributed real time systems. To make the best use of the computational power available, it is essential to assign the tasks to the processor whose characteristics are most appropriate for the execution of the tasks in a distributed processing system. This study develops two algorithms… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
5
0

Year Published

2020
2020
2024
2024

Publication Types

Select...
9

Relationship

2
7

Authors

Journals

citations
Cited by 15 publications
(5 citation statements)
references
References 18 publications
0
5
0
Order By: Relevance
“…The famous strategy for assessing the most extreme conceivable result has been the information envelopment analysis (DEA). The subtleties are given underneath (Kumar & Tyagi, 2019). The Information Envelopment Analysis strategy is a boondocks technique that doesn't need particular of a functional structure or a distributional structure, and can oblige scale issues.…”
Section: Information Envelopment Analysismentioning
confidence: 99%
“…The famous strategy for assessing the most extreme conceivable result has been the information envelopment analysis (DEA). The subtleties are given underneath (Kumar & Tyagi, 2019). The Information Envelopment Analysis strategy is a boondocks technique that doesn't need particular of a functional structure or a distributional structure, and can oblige scale issues.…”
Section: Information Envelopment Analysismentioning
confidence: 99%
“…• Input the data to be in Cluster X, data in the form of a matrix of size n x m (n, number of data samples; m, attributes of the data). X ij , data sample of-i (i=1,2...n), attribute of-j (j=1,2...m) [9].…”
Section: B Fuzzy C-meansmentioning
confidence: 99%
“…Generally speaking, similarity and dissimilarity the degree is between [0, 1], and the larger the value, the greater the degree of similarity or dissimilarity. Similarity and dissimilarity reflect two opposite definitions between objects, so they can naturally be transformed into each other through linear transformation and other methods according to the limited requirements of actual data analysis work [19].…”
Section: Related Workmentioning
confidence: 99%