Matrix-Star Graphs: A New Interconnection Network Based on Matrix Operations

Lee, Hyeong-Ok; Kim, Jong-Seok; Park, Kyoung-Wook; Seo, Jeong-Hyun; Oh, Eunseuk

doi:10.1007/11572961_38

Cited by 10 publications

(13 citation statements)

References 5 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…상호연결망으로 제안된 스타 그래프 부류는 노드 주소를 표현하는 정수의 개수 n을 이용한 팩토리얼 개의 노드수를 갖는 스타(star) 그래프 [4], 버블정렬(bubblesort) 그래프 [12], 전위(transposition) 그래프 [9], 팬케익(pancake) 그래 프 [10,11], Rotator 그래프 [12], Faber-Moore 그래프, 매크 로-스타(macro-star) 그래프 [13], 행렬스타(matrix-star) 그래프 [17], 하프팬케익 [18] 등이 있다. 스타 그래프 부류는 노드 개수가 팩토리얼개이므로 하이퍼큐브(hypercube)와 비슷한 노드 개수를 가질 때 상대적으로 망비용이 개선된 결과를 갖는다.…”

Section: 관련연구unclassified

“…[16]. 또한 스타 그래프와 행렬스타 그래 프 사이의 임베딩에 대한 연구 결과 스타 그래프가 행렬스 타 그래프의 부분 그래프임이 알려져 있다 [17]. 이에 본 연 구에서는 스타 그래프에서 개발된 여러 가지 알고리즘을 하 프팬케익 그래프에서 효율적으로 활용할 수 있는지 여부를 임베딩을 통해 분석하고자 한다.…”

Section: 관련연구unclassified

See 1 more Smart Citation

One-to-One Mapping Algorithm between Matrix Star Graphs and Half Pancake Graphs

Kim¹,

Yoo²,

Lee³

2014

Journal of Korean Institute of Intelligent Systems

Self Cite

View full text Add to dashboard Cite

Section: 관련연구unclassified

One-to-One Mapping Algorithm between Matrix Star Graphs and Half Pancake Graphs

Kim¹,

Yoo²,

Lee³

2014

Journal of Korean Institute of Intelligent Systems

Self Cite

View full text Add to dashboard Cite

“…The literature is full with such research works, whose main objective is to create new interconnection networks' topologies, investigate their attractive properties, and apply them in various problems' solutions; examples of such works can be found in [2][3][4][5][6][7]. The significance of designing a new interconnection network's topology lies in the great role it plays in improving the performance of parallel processing systems, which form the core of computing in the information revolution age.…”

Section: Introductionmentioning

confidence: 99%

The hybrid dynamic parallel scheduling algorithm for load balancing on Chained-Cubic Tree interconnection networks

Mahafzah

Jaradat

2009

J Supercomput

View full text Add to dashboard Cite

The Chained-Cubic Tree (CCT) interconnection network topology was recently proposed as a continuation for the extended efforts in the area of interconnection networks' performance improvement. This topology, which promises to exhibit the best properties of the hypercube and tree topologies, needs to be deeply investigated in order to evaluate its performance among other interconnection networks' topologies. This work comes as a complementary effort, in which the load balancing technique is investigated as one of the most important aspects of performance improvement. This paper proposes a new load balancing algorithm on CCT interconnection networks. The proposed algorithm, which is called Hybrid Dynamic Parallel Scheduling Algorithm (HD-PSA), is a combination of two common load balancing strategies; dynamic load balancing and parallel scheduling. The performance of the proposed algorithm is evaluated both, analytically and experimentally, in terms of various performance metrics; including, execution time, load balancing accuracy, communication cost, number of tasks hops, and tasks locality.

show abstract

“…Many of sorting algorithms commonly seek lower time complexity, but they can be utilized in different field with different sorting method. Especially, reversals have been researched not only in sorting in mathematical theory [1][2][3][4][5][6][7], but also in interconnection networks [8][9][10][11][12][13][14] in computer science and biological DNA computing models [15][16][17][18][19][20][21]. The sorting methods having lower time complexity such as quick sort or merge sort have been neither used for the relocation of the segments making up DNA nor designed as an interconnection network yet.…”

Section: Introductionmentioning

confidence: 99%

“…nstar [11] uses a permutation, which consists of n natural numbers, as nodes, and operations, which exchange the first element with an arbitrary element, as edges. These types of networks include macro-star [12], transposition graphs [17], and matrix-star graphs [14]. These studies proposed routings that convey messages from one arbitrary node to another, a process that is equivalent to sorting arbitrary permutations into different permutations.…”

Section: Introductionmentioning

confidence: 99%

An algorithm for sorting pancake by restricted reversals

2015

Self Cite

View full text Add to dashboard Cite

In this paper, we propose an algorithm for sorting n pancakes. The previous studies were focused on finding upper bound or lower bound regarding a limited npancake. This study, however, suggests the algorithms for n-pancake with n ≥ 5. The only constraint is that n ≥ 5, which eliminates the very strong constraints [n ≡ 0 (mod 16), n ≡ 0 (mod 14), n ≡ 3 (mod 4), etc.] that were used in previous studies. In addition, the sorting cost of the proposed algorithm is almost a half, from other existing studies, despite the fact that it reduces the degree from n − 1 to n 2 + 1. We define the term 'restricted reversal', and based on that terminology, we also propose simple sorting and improved sorting algorithms for the pancake sorting. Further, we examine the worst case time complexity and average time to complete a sort using the suggested algorithms. We also propose sorting costs for the evaluation of similar sorting algorithms such as pancake, burnt pancake, and signed permutation algorithms, and compare the sorting costs and constraints that were found in existing studies. In addition, we propose a burnt pancake sorting algorithm that employs the proposed restricted reversals.

show abstract

Matrix-Star Graphs: A New Interconnection Network Based on Matrix Operations

Cited by 10 publications

References 5 publications

One-to-One Mapping Algorithm between Matrix Star Graphs and Half Pancake Graphs

One-to-One Mapping Algorithm between Matrix Star Graphs and Half Pancake Graphs

The hybrid dynamic parallel scheduling algorithm for load balancing on Chained-Cubic Tree interconnection networks

An algorithm for sorting pancake by restricted reversals

Contact Info

Product

Resources

About