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

7th International Conference on Cloud Computing, Data Science and Engineering (Confluence)

作者： Jafar, Sana Kumar, Pankaj Rajnish, Ranjana Jafar, Minsa Amity Univ Amity Sch Engn & Technol Lucknow Uttar Pradesh India Sri Ram Swaroop Coll Engn & Management Dept Comp Sci & Engn Lucknow Uttar Pradesh India Amity Univ Amity Inst Informat Technol Lucknow Uttar Pradesh India Jamia Hamdard Dept Comp Sci New Delhi India

ISBN: (纸本)9781509035199

Embedded system design is the core for many time constraint application designs like avionics and railways. These systems employ multi core architecture for faster and time critical applications. Use of mu Iti cores as the processing part is ever challenging due to the complexities involved in their designs, memory architecture, issues related to synchronization between the cores and problems like deadlock between the executing cores. Also as per the Moore's Law, number of cores on a single processing element increase exponentially becoming double after every 18 months. In the face of such fast increasing cores the time is not far when there will be 100 or 10 00's of cores on a single chip. Then there will be bigger challenges of dealing with problems like heat dissipation, concurrency control and speedy communication between the cores, without compromising the performance and outcome of embedded systems employing these multiple cores. In this paper we have studied some of the preexisting protocols and technologies for handling concurrency in large number of multi core systems and have proposed a framework for concurrency control with a routing protocol for multi core system employing 64 cores. Then we have proposed to stale this system for higher number of cores leading to up to 100 cores and will study the performance on an embedded system.

关键词： Embedded System multi care network top ology concurrency control distributed shared memory routing protocol

来源：评论

学校读者我要写书评

暂无评论

OS Support for Thread Migration and Distribution in the Fully Heterogeneous Datacenter 17

OS Support for Thread Migration and Distribution in the Full...

引用

16th Workshop on Hot Topics in Operating Systems (HotOS)

作者： Olivier, Pierre Kim, Sang-Hoon Ravindran, Binoy Virginia Tech ECE Blacksburg VA 24061 USA

ISBN: (纸本)9781450350686

The datacenter is becoming fully heterogeneous, integrating multiple OS-capable CPUs of different Instruction Set Architectures in separate machines. These machines present diverse performance and power consumption profiles and we show that significant potential benefits for both metrics can be expected, should these machines be able to cooperate in the processing of datacenter, multi-programmed workloads. We advocate that this cooperation should be enabled at the level of the OS, relieving the programmer from any effort related to the heterogeneity of the managed machines. We propose a distributed OS architecture running on a fully heterogeneous computer cluster, enabling this cooperation through three main components: the abstraction of the entire cluster in a single system image, a distributed shared memory system, and a heterogeneous scheduler.

关键词： Operating Systems Heterogeneous Computing distributed shared memory

来源：评论

学校读者我要写书评

暂无评论

Dynamic Search Mechanism with Threat Prediction in a GNSS Receiver

引用

JOURNAL OF ELECTRICAL AND COMPUTER ENGINEERING 2017年第1期2017卷 10-10页

作者： Liu, Fang Liu, Meng Shenyang Ligong Univ Sch Informat Sci & Engn Shenyang 110159 Peoples R China

With the development of GNSS and the application of multimode signals, efficient GNSS receiver research has become very important. However, threat signals in the received signal are inevitable, which will represent important threats to navigation applications and will lead to leakage and fault detection for the receiver. Therefore, the searches with threat prediction in GNSS signals have been regarded as the important problem for GNSS receivers. In view of the limitations and nonadaptability of the current search technologies as well as on the basis of the proportionality peak judgment mechanism, a dynamic search mechanism with threat prediction (DSM-TP) is proposed in this paper, in which we define a series of preset coefficients and a threat index to optimize the decision mechanism. The simulation results demonstrate that the DSM-TP method can predict the threat situation and can adapt to lower SNR environments compared to the traditional method. In addition, the DSM-TP method can avoid the impact of threats, and the detection capability of the new method is better than the detection capability of the traditional method.

关键词： GLOBAL Positioning System MICROWAVE receivers MULTIMODE waveguides SIGNAL processing distributed shared memory

来源：评论

学校读者我要写书评

暂无评论

Performance evaluation of directory protocols on an optical broadcast-based distributed shared memory multiprocessor

引用

COMPUTERS & ELECTRICAL ENGINEERING 2010年第1期36卷 114-131页

作者： Abasikeles, Ipek Akay, M. Fatih Cukurova Univ Dept Comp Engn TR-01330 Adana Turkey

Recent advances in the development of optical technologies suggest the possible emergence of broadcast-based optical interconnects within cache-coherent distributed shared memory (DSM) multiprocessor architectures. It is well known that the cache-coherence protocol is a critical issue in designing such architectures because it directly affects memory latencies. In this paper, we evaluate via simulation the performance of three directory-based cache-coherence protocols;strict request-response, intervention forwarding and reply forwarding on the Simultaneous Optical Multiprocessor Exchange Bus (SOME-Bus), which is a low-latency and high-bandwidth broadcast-based fiber-optic interconnection network supporting DSM. The simulated system contains 64 nodes, each of which has a processor, a cache controller, a directory controller and an output channel. Simulations have been conducted for each protocol to measure average processor utilization, average network latency and average number of packets transferred over the network for varying values of the important DSM parameters such as the ratio of the mean channel service time to mean thread run time (T/R), probability of a cache block being in modified state {P(M)}, the fraction of write misses {P(W)} and home node contention rate. The results reveal that for all cases. except for low values of P(M), intervention forwarding gives the worst performance (lowest processor utilization and highest latency). The performance of strict request-response and reply forwarding is comparable for several values of the DSM parameters and contention rate. For a contention rate of 0%. the increase of P(M) makes reply forwarding perform better than strict request-response. The performance of all protocols decreases with the increase of P(W) and contention rate. However, the performance of strict request-response is the least affected among other protocols due to the negative impact of the increase of P(W) and contention rate. Therefore, for t

关键词： Directory protocols distributed shared memory Multiprocessors Performance evaluation Optical interconnects Simulation

来源：评论

学校读者我要写书评

暂无评论

Parallel Fock Matrix Construction with distributed shared memory Model for the FMO-MO Method

引用

JOURNAL OF COMPUTATIONAL CHEMISTRY 2010年第13期31卷 2381-2388页

作者： Umeda, Hiroaki Inadomi, Yuichi Watanabe, Toshio Yagi, Toru Ishimoto, Takayoshi Ikegami, Tsutomu Tadano, Hiroto Sakurai, Tetsuya Nagashima, Umpei Univ Tsukuba Ctr Computat Sci Tsukuba Ibaraki Japan Natl Inst Nat Sci Inst Mol Sci Aichi Japan Natl Inst Adv Ind Sci & Technol Res Inst Computat Sci Tsukuba Ibaraki Japan Inst Syst Informat Technol & Nanotechnol Sawara Ku Fukuoka Japan Tokyo Inst Technol Global Sci Informat & Comp Ctr Tokyo 152 Japan Edogawa Univ Fac Media Commun Chiba Japan Kyushu Univ INAMORI Frontier Res Center Nishi Ku Fukuoka 812 Japan Natl Inst Adv Ind Sci & Technol Informat Technol Res Inst Tsukuba Ibaraki Japan Univ Tsukuba Dept Comp Sci Tsukuba Ibaraki Japan

A parallel Fock matrix construction program for FMO-MO method has been developed with the distributed shared memory model. To construct a large-sized Fock matrix during FMO-MO calculations, a distributed parallel algorithm was designed to make full use of local memory to reduce communication, and was implemented on the Global Array toolkit. A benchmark calculation for a small system indicates that the parallelization efficiency of the matrix construction portion is as high as 93% at 1,024 processors. A large FMO-MO application on the epidermal growth factor receptor (EGFR) protein (17,246 atoms and 96,234 basis functions) was also carried out at the HF/6-3IG level of theory, with the frontier orbitals being extracted by a Sakurai-Sugiura eigensolver. It takes 11.3 h for the FMO calculation, 49.1 h for the Fock matrix construction, and 10 min to extract 94 eigen-components on a PC cluster system using 256 processors. (C) 2010 Wiley Periodicals, Inc. J Comput Chem 31: 2381-2388, 2010

关键词： parallel Fock matrix construction FMO-MO method distributed shared memory large MO calculation Sakurai Sugiura method

来源：评论

学校读者我要写书评

暂无评论

A Methodological Construction of an Efficient Sequentially Consistent distributed shared memory

引用

COMPUTER JOURNAL 2010年第9期53卷 1523-1534页

作者： Cholvi, Vicent Fernandez, Antonio Jimenez, Ernesto Manzano, Pilar Raynal, Michel Univ Jaume 1 Castellon de La Plana Spain Univ Rey Juan Carlos LADyR GSyC Mostoles 28933 Spain Univ Politecn Madrid Madrid 28031 Spain Univ Rennes IRISA F-35042 Rennes France

The paper proposes a simple protocol that ensures sequential consistency. The protocol assumes that the shared memory abstraction is supported by the local memories of nodes that can communicate only by exchanging messages through reliable channels. Unlike other sequential consistency protocols, the one proposed here does not rely on a strong synchronization mechanism, such as an atomic broadcast primitive or a central node managing a copy of every shared object. From a methodological point of view, the protocol is built incrementally starting from the very definition of sequential consistency. It has the noteworthy property that a process that issues a write operation never has to wait for other processes. Depending on the current local state, most read operations issued also have the same property.

关键词： distributed systems distributed shared memory sequential consistency

来源：评论

学校读者我要写书评

暂无评论

Efficient Embedded Software Migration towards Clusterized distributed-memory Architectures

引用

IEEE TRANSACTIONS ON COMPUTERS 2016年第8期65卷 2645-2651页

作者： Garibotti, Rafael Butko, Anastasiia Ost, Luciano Gamatie, Abdoulaye Sassatelli, Gilles Adeniyi-Jones, Chris CNRS LIRMM Lab Montpellier France Univ Leicester Dept Engn Leicester LE1 7RH Leics England ARM Cambridge England

A large portion of existing multithreaded embedded sofware has been programmed according to symmetric shared memory platforms where a monolithic memory block is shared by all cores. Such platforms accommodate popular parallel programming models such as POSIX threads and OpenMP. However with the growing number of cores in modern manycore embedded architectures, they present a bottleneck related to their centralized memory accesses. This paper proposes a solution tailored for an efficient execution of applications defined with shared-memory programming models onto on-chip distributed-memory multicore architectures. It shows how performance, area and energy consumption are significantly improved thanks to the scalability of these architectures. This is illustrated in an open-source realistic design framework, including tools from ASIC to microkernel.

关键词： Multicore programmability software migration distributed shared memory performance scalability

来源：评论

学校读者我要写书评

暂无评论

Specification-based Verification in a distributed shared memory Simulation Model

引用

SIMULATION-TRANSACTIONS OF THE SOCIETY FOR MODELING AND SIMULATION INTERNATIONAL 2010年第4期86卷 229-245页

作者： Marurngsith, Worawan Ibbett, Roland N. Thammasat Univ Fac Sci & Technol Dept Comp Sci Pathum Thani 12121 Thailand Univ Edinburgh Edinburgh Parallel Comp Ctr Edinburgh Midlothian Scotland

The emergence of chip multiprocessors is leading to rapid advances in hardware and software systems to provide distributed shared memory (DSM) programming models, so-called DSM systems. A DSM system provides programming advantages within a scalable and cost-effective hardware solution. This benefit derives from the fact that a DSM system creates a shared-memory abstraction on top of a distributed-memory machine by caching data replicas locally. In this respect, a coherence protocol is a vital component responsible for assuring data consistency across all replicas. The design of coherence protocols impacts a DSM system in terms of both performance and accuracy. Performance is often measured via simulation and various verification techniques have been proposed to deal with protocol accuracy. Nevertheless, integrating accuracy verification into a DSM cluster simulation to ensure correct simulation results is still an open issue. In this paper, we address three properties of a coherence protocol (safety, liveness, and inclusion) without which errors may occur in the simulation results. We propose a specification-based parameter-model interaction (SPMI) technique to detect these cases in a particular DSM cluster simulator called DSiMCluster. Our experimental results demonstrate that with SPMI, DSiMCluster can ensure the coherence protocol properties and provides a correct reflection of memory characteristics in shared-memory and DSM multiprocessors.

关键词： distributed shared memory DSM cluster coherence protocol verification technique

来源：评论

学校读者我要写书评

暂无评论

Steering of sequential jobs with a distributed shared memory based model for online steering

引用

FUTURE GENERATION COMPUTER SYSTEMS-THE INTERNATIONAL JOURNAL OF ESCIENCE 2010年第1期26卷 155-161页

作者： Lorenz, Daniel Buchholz, Peter Uebing, Christian Walkowiak, Wolfgang Wismueller, Roland Univ Siegen Inst Operating Syst & Distributed Syst D-57068 Siegen Germany Univ Siegen Expt Particle Phys Grp D-57068 Siegen Germany

Online steering systems allow one to retrieve application data like intermediate results for visualization, and to modify parameters during the run-time of the application. While most steering systems use a client/server paradigm, online steering can favorably be modeled as a distributed shared memory with concurrent access by the application and the online steerer. In this paper, this idea is formalized, focusing on the exploration of the consistency models and protocols for the distributed shared memory. The behavior of the steering system is described by consistency models, which also guarantee the data integrity of the application, both within a single process and between multiple application processes. Depending on the integrity requirements, applications can choose the proper model and protocol. The performance of our protocols is evaluated with a synthetic workload, which shows that the newly developed delayed weak consistency is faster than the special weak consistency. Furthermore, the results prove that the invalidate protocols of both consistency models are able to adapt themselves to the workload. (C) 2009 Elsevier B.V. All rights reserved.

关键词： Online steering distributed shared memory Consistency model RMOST

来源：评论

学校读者我要写书评

暂无评论

Application of self organizing maps for investigating network latency on a broadcast-based distributed shared memory multiprocessor

引用

EXPERT SYSTEMS WITH APPLICATIONS 2010年第4期37卷 2937-2942页

作者： Akay, M. Fatih Abasikeles, Ipek Oral, Mustafa Cukurova Univ Dept Comp Engn TR-01330 Adana Turkey

Broadcast-based DSM multiprocessors are nowadays an attractive platform for parallel computing due to their advantages in terms of scalability, and programmability. In order to obtain high performance out of these systems, network latency reduction techniques should be developed, which requires the knowledge of the relationship between latency and other important DSM parameters. In this paper, self organizing maps (SOM) are used to investigate the effect of DSM parameters on network latency for a multiprocessor architecture interconnected by the Simultaneous Optical Multiprocessor Exchange Bus (SOME-Bus). An event-based discrete simulator using OPNET Modeler is developed for simulating a SOME-Bus system containing 64-nodes. Two thousand data points have been collected in order to create the dataset used in this study. 2-dimensional (2D) maps are produced by using SOM to display the relationship between network latency and other parameters such as the miss rate to a modified block (P-m), fraction of write misses (P-w), probability of having an upgrade ownership request message (P-uor), probability of having a cache full (P-cf) and ratio of the mean thread run time to mean message transfer time (T/R). The results show that the most dominant DSM parameter effecting network latency is T/R. while P-cf has the minimum affect on network latency among other parameters. The individual effect of P-m, P-w and P-uor on network latency depends on the values of all other parameters. (C) 2009 Elsevier Ltd. All rights reserved.

关键词： distributed shared memory Multiprocessors Network latency Self organizing maps

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：