2010
DOI: 10.1007/978-3-642-15576-5_42
|View full text |Cite
|
Sign up to set email alerts
|

An Optimal Relationship-Based Partitioning of Large Datasets

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
5
0

Year Published

2011
2011
2014
2014

Publication Types

Select...
3

Relationship

1
2

Authors

Journals

citations
Cited by 3 publications
(5 citation statements)
references
References 3 publications
0
5
0
Order By: Relevance
“…In other words, relations between elements depend on input values, i.e. when a potential connection is activated two elements become neighbours [3] .…”
Section: Fig 1 Connectivity Modelmentioning
confidence: 99%
See 1 more Smart Citation
“…In other words, relations between elements depend on input values, i.e. when a potential connection is activated two elements become neighbours [3] .…”
Section: Fig 1 Connectivity Modelmentioning
confidence: 99%
“…The optimal partitioning can be done in two complementary ways: 1) initially -before starting the system and 2) dynamically -while the system works (online) [3]. The dynamic repartitioning is applied while the system is working (on line) -triggered by changes in inputs (that affects the calculations) or periodically if the processor load is imbalanced [6].…”
Section: Introductionmentioning
confidence: 99%
“…In our studies [5,6,12], evolutionary algorithms are used for the initial partitioning. This allows the use of somewhat slower algorithms since it is done prior to startup.…”
Section: Related Workmentioning
confidence: 99%
“…This paper compares hybrid GA with previously used GA [5,12] and PSO [6,12] algorithms for initial graph partitioning.…”
Section: Related Workmentioning
confidence: 99%
“…Therefore, graph edges represent open switches between elements from different roots. The weight of the vertex is determined by the calculation complexity of the corresponding root and the weight of edge are defined as the number of open switches between the corresponding roots [6].…”
Section: Introductionmentioning
confidence: 99%