Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userEnhancing Cost In Interconnection Networks by hybridization
تحسين الكلفة في شبكات ربط المعالجات الصغرية صن طريق التهجين
1195
0 20
0
(
0
)
Created by
Shamra Editor
Ask ChatGPT about the research
إن اهم ما يميز أنظمة المعالجات التفرعية ذات عدد المعالجات الضخمة هو طوبولوجيا شبكة الربط أي كيفية ربط هذه المعالجات مع بعضها البعض بحيث تؤمن نقل سريع للبيانات و بكلفة منخفضة. سنقوم في هذا البحث بإيجاد شبكات ربط جديدة تؤمن سرعة في النقل و كلفة منخفضة بالمقارنة مع باقي الشبكات التقليدية لربط المعالجات. تقسم شبكات ربط المعالجات الصغرية لشبكات ستاتيكية تكون الوصلات فيها ثابتة بين المعالجات و شبكات ديناميكية بحيث يملك كل اتصال بين معالجين أكثر من مسار واحد. و تختلف كل شبكة عن الأخرى بالكلفة التي نعبر عنها بعدد الوصلات ضمن هذه الشبكة, و السرعة و التي نعبر عنهما بقطر الشبكة و عرض حزمة التصنيف بحيث تكون الشبكة أفضل كلما كانت كلفتها أقل و قطرها أقل و عرض حزمة التصنيف أكبر. سنقوم في هذا البحث بالمقارنة بين هذه الشبكات و اقتراح شبكات جديدة من خلال التهجين بين الشبكات الاساسية و دراسة مواصفات هذه الشبكات الهجينة بالمقارنة مع الشبكات الأساسية المكونة لها.
The most important characteristic of Massively Parallel Computing systems is the topology of the network that means how to connect the processors with each other so that provides fast data transfer and low cost. In this research, we will find new link networks that provide speed in the transport and low cost compared with other traditional networks for connecting processors. Interconnection networks are divided to be static networks so that fixed links between processors, while dynamic networks so that every communication between two processors owns more than one path. Each network differs from the other in cost which express the number of links within this network, and speed which express the network diameter and bisection. The network is best whenever the cost is less and diameter is less but bisection is larger. In this research I compared between these networks and then look for new networks through hybridization between core networks. After that I studied the specification of hybrid interconnections compared with its constituent core networks.
References used
LIU Youyao: A Hypercube-based Scalable Interconnection Network for Massively Parallel Computing, JOURNAL OF COMPUTERS, VOL. 3, NO. 10, OCTOBER 2008
William James Dally & Brian Towles: Principles and practices of interconnection networks, Morgan Kaufmann Publishers, 2004
Ruei-Yu Wu, Gen-Huey Chen, Gerard J. Chang, and Jung- Sheng Fu: Cycles Embedding Problem in Hierarchical Hypercube Networks, The 24th Workshop on Combinatorial Mathematics and Computation Theory
rate research
Read More
Rectangular mesh and torus are the mostly used topologies in
network-on-chip (NoC) based systems. In this paper، we
quantitatively illustrate that the honeycomb topology is an
advantageous design alternative in terms of network cost which is
one of the most important parameters that reflects both network
performance and implementation cost.
Multi hop wireless networks face many challenges basically the
limitation of bandwidth, loss of packets because of many problems
in wireless medium also loss of paths because of the random and
unpredictable movement of wireless nodes, which reduce
the
performance of these networks. Recently, Network coding has been
used as promising technology that achieves the reliable transfer of
data in wireless networks with high throughput. Considering the
efficiency of this technology and with benefiting from both the
same cost paths and the broadcasting property of wireless medium,
a multi transmission mechanism for random linear network coding
has been proposed in multi hop wireless networks, which depends
on multicasting of coded packets on the same cost paths.
Operational research science aims to find the optimal solution
to many problems in various life domains. One of the most famous
is the network analysis. Problem. In this paper we introduce an
effective algorithm with linear time O ( n + k ) within it all network
activities are executed within determined period and with a
minimum cost.
In WDM networks, the end users exchange information with each other through all optical WDM
channels, called light-paths. A light-path must occupy the same wavelength on all the fiber links
through which it traverses. In a WDM optical network, with
a given set of connections, the
question of setting up light-paths by routing and allocating a wavelength to each connection is
called Routing and Wavelength Assignment (RWA) problem. Integer Linear Programming (ILP) is
a mathematical formulation helps in minimizing and maximizing an object function under multiple
constraints. This can help in formulating a mathematical model for RWA. This paper studies a
mathematical model for RWA in WDM Optical networks which can lead to a good network
planning. This paper suggests an enhancement proposal for Syrian telecommunication optical
networks using ILP formulation.
Mobile Wireless Sensor Network (MWSN) is an emerging technology for attraction of
researchers with its research advantage and various application domains. Due to limited
resources of sensor nodes such as transmission power, communication capability
and
size of memory, data aggregation algorithms are the most practical technique that reduces
large amount of transmission in this network. Security is an important criterion to be
considered because, wireless sensor nodes are deployed in a remote or hostile
environment area that is prone to attacks easily. Therefore, security are essential issue
for MWSN to protect information against attacks.
In this research, we offered an algorithm of secure data aggregation in MWSN based on
pair-wise keys technology and hash function. We studied important parameters such as
execution time, end-to-end delay and number of storied keys. Results showed that
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
