检索结果-内蒙古大学图书馆

A Substrate Integrated Slot Leaky-Wave Antenna for point-to-point communication

IEEE TRANSACTIONS ON ANTENNAS AND PROPAGATION 2022年第10期70卷 9888-9893页

作者： Zhang, Weiquan Li, Yue Zhang, Zhijun Tsinghua Univ Dept Elect Engn Beijing 100084 Peoples R China Tsinghua Univ Beijing Natl Res Ctr Informat Sci & Technol Beijing 100084 Peoples R China

In this communication, we present a longitudinally slotted substrate integrated slot (SIS) leaky-wave antenna (LWA) for point-to-point communication. To mitigate the dispersion of traditional substrate integrated waveguide (SIW) LWAs, an SIS is proposed by etching a long straight slot along the SIW. The loaded slot mitigates the dispersion of SIW due to the special electric field distribution. Anti-TE10 mode is excited inside the SIS. Then, longitudinal slots are symmetrically loaded on both sides of the long slot. The prototype of SIS LWA is validated by the simulated and experimental results. A frequency bandwidth of 10.3% is realized with the beam squinting within 7 degrees and realized gain of 13.9 +/- 0.7 dB at a fixed angle of -7 degrees. The proposed antenna is intended for point-to-point communication.

关键词： Gain Dispersion Substrates Bandwidth Loading Antenna radiation patterns Leaky wave antennas Leaky-wave antenna (LWA) low dispersion point-to-point communication substrate integrated slot (SIS)

来源：评论

学校读者我要写书评

暂无评论

P-3PC: A point-to-point communication model for automatic and optimal decomposition of regular domain problems

引用

IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS 2002年第7期13卷 758-768页

作者： Seinstra, FJ Koelma, D Univ Amsterdam Fac Sci NL-1098 SJ Amsterdam Netherlands

One of the most fundamental problems automatic parallelization tools are confronted with is to find an optimal domain decomposition for a given application. For regular domain problems (such as simple matrix manipulations), this task may seem trivial. However, communication costs in message passing programs often significantly depend on the memory layout of data blocks to be transmitted. As a consequence, straightforward domain decompositions may be nonoptimal. In this paper, we introduce a new point-to-point communication model (called P-3PC, or the "Parameterized model based on the Three Paths of communication") that is specifically designed to overcome this problem. In comparison with related models (e.g., LogGP) P-3PC is similar in complexity, but more accurate in many situations. Although the model is aimed at MPI's standard point-to-point operations, it is applicable to similar message passing definitions as well. The effectiveness of the model is tested in a framework for automatic parallelization of low level image processing applications. Experiments are performed on two Beowulf-type systems, each having a different interconnection network, and a different MPI implementation. Results show that, where other models frequently fail, P-3PC correctly predicts the communication costs related to any type of domain decomposition.

关键词： MPI point-to-point communication performance optimization performance modeling automatic domain decomposition

来源：评论

学校读者我要写书评

暂无评论

RRABP: point-to-point communication over Unreliable Components

引用

31st Communicating Process Architectures Conference

作者： Sputh, Bernhard H. C. Faust, Oliver Allen, Alastair R. Univ Aberdeen Sch Engn Aberdeen AB24 3UE Scotland

ISBN: (纸本)9781586039073

This paper establishes the security, stability and functionality of the reset-table receiver alternating bit protocol, This protocol creates a reliable and blocking channel between sender and receiver over unreliable non-blocking communication channels. Furthermore, this protocol permits the sender to be replaced at any time, but not under all conditions without losing a message. The protocol is in extension to tire alternating bit protocol with the ability for the sender to synchronise the receiver and restart the transmission. The resulting protocol uses as few messages as possible to fulfil its duty, which makes its implementation lightweight and suitable for embedded systems. An unexpected outcome of this work is the large number of different messages needed to reset tire receiver reliably.

关键词： point-to-point communication reliability unstable sender

来源：评论

学校读者我要写书评

暂无评论

Improving Performance Models for Irregular point-to-point communication 18

Improving Performance Models for Irregular Point-to-Point Co...

引用

25th European MPI Users' Group Meeting (EuroMPI)

作者： Bienz, Amanda Gropp, William D. Olson, Luke N. Univ Illinois Champaign IL 61820 USA

ISBN: (纸本)9781450364928

Parallel applications are often unable to take full advantage of emerging parallel architectures due to scaling limitations, which arise due to inter-process communication. Performance models are used to analyze the sources of communication costs. However, traditional models for point-to-point communication fail to capture the full cost of many irregular operations, such as sparse matrix methods. In this paper, a node-aware based model is presented. Furthermore, the model is extended to include communication queue search time as well as an additional parameter estimating network contention. The resulting model is applied to a variety of irregular communication patterns throughout matrix operations, displaying improved accuracy over traditional models.

关键词： MPI performance modeling point-to-point communication queue search network contention

来源：评论

学校读者我要写书评

暂无评论

A snap-stabilizing point-to-point communication protocol in message-switched networks

A snap-stabilizing point-to-point communication protocol in ...

引用

23rd IEEE International Parallel and Distributed Processing Symposium

作者： Cournier, Alain Dubois, Swan Villain, Vincent Univ Picardie MIS Lab 33 Rue St Leu F-80039 Amiens 1 France Univ Paris 06 INRIA Rocquencourt UMR 7606 LIP6 F-75016 Paris France

ISBN: (纸本)9781424437511

A snap-stabilizing protocol, starting from any configuration, always behaves according to its specification. In this paper we present a snap-stabilizing protocol to solve the message forwarding problem in a message switched network. In this problem, we must manage resources of the system to deliver messages to any processor of the network. In this purpose, we use informations given by a routing algorithm. By the context of stabilization (in particular the system starts in any configuration), these informations can be corrupted. So, the existence of a snap-stabilizing protocol for the message forwarding problem implies that we can ask the system to begin forwarding messages even if routing informations are initially corrupted. In this paper we propose a snap-stabilizing algorithm (in the state model) for the following specification of the problem: Any message can be generated in a finite time. Any emitted message will be delivered to its destination once and only once in a finite time. This implies that our protocol can deliver any emitted message regardless of the state of routing tables in the initial configuration.

关键词： Distributed protocols snap-stabilization fault-tolerance message forwarding point-to-point communication deadlock-free routing messages-witched networks

来源：评论

学校读者我要写书评

暂无评论

CFDComm: An optimized library for scalable point-to-point communication for general CFD applications

CFDComm: An optimized library for scalable point-to-point co...

引用

14th IEEE International Conference on High Performance Computing and communications (HPCC) / IEEE 9th International Conference on Embedded Software and Systems (ICESS)

作者： Haeri, S. Shrimpton, J. S. Univ Southampton Sch Engn Sci Southampton S017 1BJ Hants England

ISBN: (纸本)9780769547497

Domain decomposition is the most widely used technique to achieve parallelism in CFD applications. For complicated geometries usually graph partitioning programs are used to decompose the domain into smaller computational blocks such that the computation load is balanced and communication cost is minimized. In this paper an algorithm is provided and tested which avoids deadlocks in complicated communications patterns inherited from the graph decomposition process. The basic algorithm is implemented using FORTRAN 95 and MPI and then several optimization techniques are used to increase the scalability of the library which include addition of topologies, overlap of communication and computation to mask the message passing latency and non-blocking communication. The library is tested for up to 512 cores on the Iridis-3 cluster which incorporates 1008 compute nodes each composed of 2, 2.4 GHz 6-core Westmere processors. IO and inter-node communication is via a fast Infiniband network which is composed of groups of 32 nodes connected by DDR links to a 48 port QDR leaf-switch. The leaf switches then have 4 trunked QDR connections to 4 QDR 48-port core switches.

关键词： MPI point-to-point communication Domain Decomposition Parallel Performance Computational Fluid Dynamics

来源：评论

学校读者我要写书评

暂无评论

Designing Dynamic and Adaptive MPI point-to-point communication Protocols for Efficient Overlap of Computation and communication 32nd

Designing Dynamic and Adaptive MPI Point-to-Point Communicat...

引用

32nd International Conference on High Performance Computing (ISC High Performance)

作者： Subramoni, Hari Chakraborty, Sourav Panda, Dhabaleswar K. Ohio State Univ Dept Comp Sci & Engn Columbus OH 43210 USA

ISBN: (纸本)9783319586670

Broadly, there exist two protocols for point-to-point data transfer in the Message Passing Interface (MPI) programming model Eager and Rendezvous. State-of-the-art MPI libraries decide the switch point between these protocols based on the trade-off between memory footprint of the MPI library and communication performance without considering the overlap potential of these communication protocols. This results in sub-par overlap of communication and computation at the application level. While application developers can manually tune this threshold to achieve better overlap, it involves significant effort. Further, the communication pattern may change based on the size of the job and the input requiring constant re-tuning making such a solution impractical. In this paper, we take up this challenge and propose designs for point-to-point data transfer in MPI which accounts for overlap in addition to performance and memory footprint. The proposed designs dynamically adapt to the communication characteristic of each communicating pair of processes at runtime. Our proposed full in-band design is able to transition from one eager-threshold to another without impacting the communication throughput of the application. The proposed enhancements to limit the memory footprint by dynamically freeing unused internal communication buffer is able to significantly cut down on memory footprint of the MPI library without affecting the communication performance. Experimental evaluations show that the proposed dynamic and adaptive design is able to deliver performance on-par with what exhaustive manual tuning provides while limiting the memory consumed to the absolute minimum necessary to deliver the desired benefits. For instance, with the Amber molecular dynamics application at 1,024 processes, the proposed design is able to perform on-par with the best manually tuned versions while reducing the memory footprint of the MPI library by 25%. With the 3D-Stencil benchmark at 8,192 processes

关键词： MPI point-to-point communication Overlap of communication and computation

来源：评论

学校读者我要写书评

暂无评论

Cylindrical Dielectric Resonator Antenna Offering Low Cross-Polarization for point-to-point communication Systems

Cylindrical Dielectric Resonator Antenna Offering Low Cross-...

引用

作者： Reddy, P. S. Brno University of Technology

In this paper, a cylindrical dielectric resonator antenna (CDRA) offering low cross-polarization (XP) for point-to-point communication systems is presented. Three linear arrays of air vias (LAAV) are incorporated along the H-plane of a conventionalCDRAin order toweaken the undesired XP generating fields due to the orthogonally resonating HEM21X mode. A set of parametric studies are conducted on the design parameters of the 3-LAAV in CDRA to understand the sensitivity of boresight XPD on the 3-LAAV design parameters. Field distributions in CDRA before and after the incorporation of LAAV are extensively studied to draw a conclusive inference. The 3-LAAV loaded CDRA offers 39 dB higher boresight XP suppression in comparison to the conventional CDRA. The proposed technique is experimentally validated. The measured result shows an XP isolation of 56 dB at the boresight, 55 dB and 38 dB over ±15 % of half-power beamwidth (HPBW) in the E-plane and H-plane of radiation, respectively. This result is well above the minimum cross-polarization discrimination (XPD) requirements for the satellite earth station antennas.

关键词： Cross-polarization dielectric resonator antenna point-to-point communication parabolic reflector antenna

来源：评论

学校读者我要写书评

暂无评论

Joint carrier frequency and phase offset estimation algorithm for CPM-DSSS based secure point-to-point communication

引用

TURKISH JOURNAL OF ELECTRICAL ENGINEERING AND COMPUTER SCIENCES 2021年第7期29卷 3020-3035页

作者： Shehzadi, Saima Kulsoom, Farzana Zeeshan, Muhammad Khan, Qasim Umar Sheikh, Shahzad Amin Natl Univ Sci & Technol Coll Elect & Mech Engn Dept Elect Engn Islamabad Pakistan Univ Engn & Technol Dept Telecommun Engn Taxila Pakistan

A point-to-point (P2P) communication system based on the CPM-DSSS scheme ensures reliability, security, and antijamming capabilities. However, for reliable detection of data carrier synchronization of CPM-DSSS based system is one of the requirements. This paper presents a joint algorithm for carrier frequency offset (CFO) and carrier phase offset (CPO) estimation for CPM-DSSS based P2P system. The results indicate that the proposed CFO estimator is unbiased and can accurately estimate a wide range of offsets. Moreover, the proposed algorithm is compared with another research work. The results show that the proposed CFO and CPO estimation algorithm outperforms its counterpart with a performance improvement of about 9 dB and above, respectively. The effectiveness of the proposed estimator in the Stanford University Interim (SUI)-1 multipath fading channel is also demonstrated. Finally, the proposed estimator's bit-error-rate (BER) performance and computational complexity are also given for the CPM-DSSS P2P system.

关键词： Carrier frequency offset wideband CPM-DSSS waveform of software defined radio carrier synchronization carrier phase offset point-to-point communication

来源：评论

学校读者我要写书评

暂无评论

Characterization of Secure Multiparty Computation Without Broadcast

引用

JOURNAL OF CRYPTOLOGY 2018年第2期31卷 587-609页

作者： Cohen, Ran Haitner, Iftach Omri, Eran Rotem, Lior Bar Ilan Univ Dept Comp Sci Ramat Gan Israel Tel Aviv Univ Sch Comp Sci Tel Aviv Israel Ariel Univ Dept Comp Sci & Math Ariel Israel Hebrew Univ Jerusalem Sch Comp Sci & Engn Jerusalem Israel

A major challenge in the study of cryptography is characterizing the necessary and sufficient assumptions required to carry out a given cryptographic task. The focus of this work is the necessity of a broadcast channel for securely computing symmetric functionalities (where all the parties receive the same output) when one third of the parties, or more, might be corrupted. Assuming all parties are connected via a point-to-point network, but no broadcast channel (nor a secure setup phase) is available, we prove the following characterization:A symmetric n-party functionality can be securely computed facing corruptions (i.e., honest majority), if and only if it is -dominated;a functionality is k-dominated, if any k-size subset of its input variables can be set to determine its output to some predetermined value. Assuming the existence of one-way functions, a symmetric n-party functionality can be securely computed facing corruptions (i.e., no honest majority), if and only if it is 1-dominated and can be securely computed with broadcast. It follows that, in case a third of the parties might be corrupted, broadcast is necessary for securely computing non-dominated functionalities (in which "small" subsets of the inputs cannot determine the output), including, as interesting special cases, the Boolean XOR and coin- flipping functionalities.

关键词： Broadcast point-to-point communication Multiparty computation Coin flipping Fairness Impossibility result

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：