با سلام خدمت کاربران در صورتی که با خطای سیستم پرداخت بانکی مواجه شدید از طریق کارت به کارت (6037997535328901 بانک ملی ناصر خنجری ) مقاله خود را دریافت کنید (تا مشکل رفع گردد).
ردیف | عنوان | نوع |
---|---|---|
1 |
A parallel algorithm for constructing independent spanning trees in twisted cubes
یک الگوریتم موازی برای ساخت درختان پوشای مستقل در مکعب های پیچ خورده-2017 A long-standing conjecture mentions that a k-connected graph G admits k independent
spanning trees (ISTs for short) rooted at an arbitrary node of G. An n-dimensional twisted
cube, denoted by TQn, is a variation of hypercube with connectivity n and has many features
superior to those of hypercube. Yang (2010) first proposed an algorithm to construct n
edge-disjoint spanning trees in TQn for any odd integer n > 3 and showed that half of them
are ISTs. At a later stage, Wang et al. (2012) inferred that the above conjecture in affirmative
for TQn by providing an O(N log N) time algorithm to construct n ISTs, where N = 2n is
the number of nodes in TQn. However, this algorithm is executed in a recursive fashion
and thus is hard to be parallelized. In this paper, we revisit the problem of constructing
ISTs in twisted cubes and present a non-recursive algorithm. Our approach can be fully
parallelized to make the use of all nodes of TQn as processors for computation in such a
way that each node can determine its parent in all spanning trees directly by referring its
address and tree indices in O(log N) time.
Keywords: Parallel algorithms | Independent spanning trees | Interconnection networks | Twisted cubes |
مقاله انگلیسی |
2 |
Optical interconnects for extreme scale computing systems
اتصالات داخلی نوری برای سیستم های محاسباتی در مقیاس بسیار زیاد-2017 Large-scale high performance computing is permeating nearly every corner of modern ap
plications spanning from scientific research and business operations, to medical diagnos
tics, and national security. All these communities rely on computer systems to process vast
volumes of data quickly and efficiently, yet progress toward increased computing power
has experienced a slowdown in the last number of years. The sheer cost and scale, stem
ming from the need for extreme parallelism, are among the reasons behind this stall. In
particular, very large-scale, ultra-high bandwidth interconnects, essential for maintaining
computation performance, represent an increasing portion of the total cost budget.
Photonic systems are often cited as ways to break through the energy-bandwidth lim
itations of conventional electrical wires toward drastically improving interconnect perfor
mance. This paper presents an overview of the challenges associated with large-scale in
terconnects, and reviews how photonic technologies can contribute to addressing these
challenges. We review some important aspects of photonics that should not be underesti
mated in order to truly reap the benefits of cost and power reduction.
Keywords: Exascale | High performance computing | Optical interconnects | Interconnection networks | Silicon photonics |
مقاله انگلیسی |
3 |
الگوریتم خوشه بندی موازی در گراف ستاره و کارایی آن
سال انتشار: 2013 - تعداد صفحات فایل pdf انگلیسی: 12 - تعداد صفحات فایل doc فارسی: 28 |
مقاله ترجمه شده |