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

您好，读者！请登录

内蒙古大学图书馆

首页
概况
党建
资源
服务
科研支持
- 论文收录引用证明
- 科技查新
知识产权
档案馆
帮助

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入0个字，您还可以输入200个字

全部搜索
期刊论文
图书
学位论文
标准
纸本馆藏
外文资源发现
数据库导航
超星发现

高级检索

时间限定

出版年份：

文献类型

图书期刊文献学位论文多媒体

馆藏选择

电子馆藏纸本馆藏

核心期刊

全部期刊 SCI 收录期刊 SSCI 收录期刊 EI 收录期刊 CSCD 收录期刊 CSSCI 收录期刊

语言

中文英文

文献类型

期刊文献图书学位论文标准纸本馆藏

帮助

文字说明：

T=题名（书名、题名），A=作者（责任者），K=主题词，P=出版物名称，PU=出版社名称，O=机构（作者单位、学位授予单位、专利申请人），L=中图分类号，C=学科分类号，U=全部字段，Y=年（出版发行年、学位年度、标准发布年）

检索规则说明：

AND代表“并且”；OR代表“或者”；NOT代表“不包含”；(注意必须大写,运算符两边需空一格)

检索范例：

范例一：(K=图书馆学 OR K=情报学) AND A=范并思 AND Y=1982-2016
范例二：P=计算机应用与软件 AND (U=C++ OR U=Basic) NOT K=Visual AND Y=2011-2016

分类表

所选分类

>> <<

限定检索结果

文献类型

10,305 篇 会议
251 篇 期刊文献
185 册 图书
2 篇 学位论文

馆藏范围

10,743 篇 电子文献
1 种 纸本馆藏

日期分布

学科分类号

4,858 篇 工学
- 4,307 篇 计算机科学与技术...
- 3,041 篇 软件工程
- 721 篇 电气工程
- 684 篇 信息与通信工程
- 521 篇 控制科学与工程
- 375 篇 电子科学与技术（可...
- 161 篇 机械工程
- 147 篇 动力工程及工程热...
- 98 篇 网络空间安全
- 97 篇 生物工程
- 91 篇 安全科学与工程
- 86 篇 仪器科学与技术
- 79 篇 建筑学
- 71 篇 土木工程
- 71 篇 生物医学工程（可授...
- 64 篇 化学工程与技术
- 57 篇 材料科学与工程（可...
- 54 篇 力学（可授工学、理...
- 54 篇 光学工程
1,330 篇 理学
- 955 篇 数学
- 213 篇 系统科学
- 163 篇 统计学（可授理学、...
- 156 篇 物理学
- 120 篇 生物学
- 67 篇 化学
1,047 篇 管理学
- 827 篇 管理科学与工程(可...
- 409 篇 工商管理
- 253 篇 图书情报与档案管...
120 篇 经济学
- 120 篇 应用经济学
71 篇 法学
- 58 篇 社会学
45 篇 教育学
40 篇 医学
26 篇 农学
14 篇 文学
9 篇 军事学
2 篇 艺术学

主题

1,688 篇 application soft...
898 篇 distributed comp...
875 篇 computer archite...
873 篇 computer science
849 篇 hardware
728 篇 concurrent compu...
668 篇 parallel process...
559 篇 computational mo...
558 篇 software enginee...
446 篇 real time system...
345 篇 runtime
326 篇 costs
324 篇 software systems
319 篇 processor schedu...
317 篇 fault tolerance
315 篇 resource managem...
292 篇 software
289 篇 operating system...
287 篇 scalability
283 篇 bandwidth

机构

35 篇 school of comput...
23 篇 ibm thomas j. wa...
22 篇 department of co...
21 篇 school of softwa...
20 篇 college of compu...
20 篇 school of electr...
19 篇 state key labora...
19 篇 department of el...
19 篇 department of co...
18 篇 department of co...
16 篇 school of comput...
15 篇 department of el...
15 篇 department of co...
15 篇 department of co...
15 篇 department of co...
14 篇 department of el...
14 篇 beijing jiaotong...
13 篇 department of co...
13 篇 school of comput...
13 篇 institute of inf...

作者

20 篇 m. takizawa
20 篇 rajkumar buyya
20 篇 k.h. kim
18 篇 dhabaleswar k. p...
18 篇 jack dongarra
17 篇 m. kandemir
17 篇 h.j. siegel
16 篇 a. choudhary
14 篇 m. parashar
14 篇 howard jay siege...
13 篇 l.r. welch
13 篇 parashar manish
13 篇 gao guang r.
12 篇 dongarra jack
12 篇 h. casanova
12 篇 hari subramoni
12 篇 welch lonnie r.
12 篇 xiao qin
12 篇 maciejewski anth...
11 篇 jun wang

语言

10,670 篇 英文
37 篇 其他
34 篇 中文
1 篇 西班牙文
1 篇 法文
1 篇 葡萄牙文

检索条件"任意字段=International Symposium on Software Engineering for Parallel and Distributed Systems"

共 10743 条记录，以下是4881-4890 订阅

全选清除本页清除全部题录导出标记到"检索档案"

详细简洁

排序：

Towards efficient shared memory communications in MPJ express

Towards efficient shared memory communications in MPJ expres...

引用

international symposium on parallel and distributed Processing (IPDPS)

作者： Aamir Shafi Jawad Manzoor School of Electrical Engineering and Computer Science National University of Science and Technology Pakistan

The need to increase performance while conserving energy lead to the emergence of multi-core processors. These processors provide a feasible option to improve performance of software applications by increasing the number of cores, instead of relying on increased clock speed of a single core. The uptake of multi-core processors by hardware vendors present variety of challenges to the software community. In this context, it is important that messaging libraries based on the message passing interface (MPI) standard support efficient inter-core communication. Typically processing cores of today's commercial multi-core processors share the main memory. As a result, it is vital to develop devices to exploit this. MPJ Express is our implementation of the MPI-like Java bindings. The software has mainly supported communication with two devices; the first is based on Java New I/O (NIO) and the second is based on Myrinet. In this paper, we present two shared memory implementations meant for providing efficient communication of multi-core and SMP clusters. The first implementation is pure Java and uses Java threads to exploit multiple cores. Each Java thread represents anMPI level OS process and communication between these threads is achieved using shared data structures. The second implementation is based on the System V (SysV) IPC API. Our goal is to achieve better communication performance than already existing devices based on transmission control protocol (TCP) and Myrinet on SMP and multi-core platforms. Another design goal is that existing parallel applications must not be modified for this purpose, thus relieving application developers from extra efforts of porting their applications to such modern clusters. We have benchmarked our implementations and report that threads-based device performs the best on an Intel quad-core Xeon cluster.

关键词： Java Multicore processing Yarn software performance Application software Clocks Hardware Context software libraries Message passing

来源：评论

学校读者我要写书评

暂无评论

A high level development, modeling and simulation methodology for complex multicore Network Processors

A high level development, modeling and simulation methodolog...

引用

international symposium on Performance Evaluation of Computer & Telecommunication systems SPECTS

作者： Gianni Antichi Christian Callegari Andrea Di Pietro Domenico Ficara Stefano Giordano Fabio Vitucci Massimiliano Meneghin Massimo Torquati Marco Vanneschi Massimo Coppola Department of Information Engineering University of Pisa Italy Computer Science Dept University of Pisa Italy ISTI-CNR Pisa Italy

Network processors (NPs) are attracting and powerful platforms for the fast development of high performance network applications. However, despite their greater flexibility and limited cost with respect to specialized hardware design, NP still face developers with significant difficulties. As they target complex and high performance applications, programmers are often forced to write assembly code in order to better exploit the hardware. In this paper we propose an approach to NP programming which is based on a three phase development methodology, and we apply it to Intel NPs of the IXP2XXX family. By exploiting a composition of software tools, a high level definition of the application is turned first into a distributed program, then into an NP prototype, and finally into an efficient NP executable. The methodology we describe takes advantage of the Assist technology, which allows for the porting, testing, modeling and profiling of parallel applications on a cluster of standard PCs. We developed a C library that acts as a communication layer, hiding the hardware details of NP programming and allowing for high performance code development. The ultimate goal of this approach is to let programmers write C code, exploiting Assist provided hints to perform functional debugging and performance analysis and to experiment with different parallel structures. The resulting code can be then directly compiled for the NP without modifications, largely reducing the overall coding effort.

关键词： Multicore processing Hardware Programming profession Application software Costs Assembly software tools software prototyping Testing Personal communication networks

来源：评论

学校读者我要写书评

暂无评论

A robust dynamic optimization for MPI Alltoall operation

A robust dynamic optimization for MPI Alltoall operation

引用

international symposium on parallel and distributed Processing (IPDPS)

作者： Hyacinthe Nzigou Mamadou Takeshi Nanri Kazuaki Murakami Department of Informatics Kyushu University Fukuoka Japan Research Institute for Information Technology Kyushu University Japan Faculty of Information Science and Electrical Engineering Kyushu University Japan

The performance of the Message Passing Interface collective communications is a critical issue to high performance computing widely discussed. In this paper we propose a mechanism that dynamically selects the most efficient MPI Alltoall algorithm for a given system/workload situation. This implementation method starts by grouping the fast algorithms based on respective performance prediction models that were obtained by using the point-to-point model P-LogP. The experiments performed on different parallel machines equipped with Infiniband and Gigabit Ethernet interconnects produced encouraging results, with negligible overhead to find the most appropriate algorithm to carry on the operation. In most cases, the dynamic Alltoall largely outperforms the traditional MPI implementations on different platforms.

关键词： Robustness Message passing Predictive models parallel algorithms Communication switching Informatics Information technology Information science Operating systems Context

来源：评论

学校读者我要写书评

暂无评论

Predictive analysis and optimisation of pipelined wavefront computations

Predictive analysis and optimisation of pipelined wavefront ...

引用

international symposium on parallel and distributed Processing (IPDPS)

作者： G.R. Mudalige S.D. Hammond J.A. Smith S.A. Jarvis High Performance Systems Group University of Warwick Coventry UK

Pipelined wavefront computations are a ubiquitous class of parallel algorithm used for the solution of a number of scientific and engineering applications. This paper investigates three optimisations to the generic pipelined wavefront algorithm, which are investigated through the use of predictive analytic models. The modelling of potential optimisations is supported by a recently developed reusable LogGP-based analytic performance model, which allows the speculative evaluation of each optimisation within the context of an industry-strength pipelined wavefront benchmark developed and maintained by the United Kingdom Atomic Weapons Establishment (AWE). The paper details the quantitative and qualitative benefits of: (1) parallelising computation blocks of the wavefront algorithm using OpenMP; (2) a novel restructuring/shifting of computation within the wavefront code and, (3) performing simultaneous multiple sweeps through the data grid.

关键词： Concurrent computing Pervasive computing Context modeling Grid computing parallel algorithms Algorithm design and analysis Predictive models Performance analysis Defense industry Weapons

来源：评论

学校读者我要写书评

暂无评论

Resource Scopes: Toward Language Support for Compositional Determinism

Resource Scopes: Toward Language Support for Compositional D...

引用

international symposium on Object-Oriented Real-Time distributed Computing

作者： Madhukar Anand Sebastian Fischmeister Insup Lee Cisco Systems Inc. USA Department of Elect. and Comp. Eng. University of Waterloo Canada Department of Comp. and Inf. Science University of Pennsylvania USA

Complex real-time embedded systems should be compositional and deterministic in the resource, time, and value domains. Determinism eases the engineering of correct systems and compositionality simplifies the assembly of complex systems out of smaller modules. This paper describes the PEACOD framework that is developed to support deterministic behavior for resource consumption, value passing, and timing. The paper introduces the notions of determinism in the context of the resource, value, and temporal domains, and present the resource-scope language construct that can be used to program such deterministic behaviors. Furthermore, the paper also provides semantics for the resource scope construct and uses these semantics to show that the program behavior is preserved under composition. The paper briefly describes the current implementation of PEACOD.

关键词： Timing Real time systems Embedded system Sampling methods distributed computing systems engineering and theory Assembly systems Embedded computing Sensor systems Embedded software

来源：评论

学校读者我要写书评

暂无评论

P2P-Tuple: Towards a Robust Volunteer Computing Platform

P2P-Tuple: Towards a Robust Volunteer Computing Platform

引用

IEEE international Conference on parallel and distributed Computing, Applications and Technologies (PDCAT)

作者： Lei Ni Aaron Harwood Department of Computer Science and Software Engineering University of Melbourne Australia NICTA Victoria Research Laboratory Australia

The evolution of emerging volunteer computing systems is placing an ever greater emphasis on the use of a loosely coupled decentralized architecture, mainly to address concerns of scalability and robustness. We propose to build the next generation volunteer computing systems on top of well studied peer-to-peer techniques to fully take advantage of its decentralized characteristic and its very large, shared data storage capacity. This paper sketches the design of such a completely decentralized and fault tolerant volunteer computing system by using a peer-to-peer based tuple space formed by volunteer peers. Both simulation and software prototype evaluation results show support for the proposed design even when all peers are having a high churn rate of Mean Time Before Failure of 2 hours.

关键词： Robustness Peer to peer computing Virtual colonoscopy Network servers distributed computing Computer architecture Concurrent computing Aggregates Bandwidth File servers

来源：评论

学校读者我要写书评

暂无评论

GenWrapper: A generic wrapper for running legacy applications on desktop grids

GenWrapper: A generic wrapper for running legacy application...

引用

international symposium on parallel and distributed Processing (IPDPS)

作者： Attila Csaba Marosi Zoltan Balaton Peter Kacsuk MTA SZTAKI Computer and Automation Research Institute Hungarian Academy of Sciences (ATOMKI) Budapest Hungary

Desktop grids represent an alternative trend in grid computing using the same software infrastructure as volunteer computing projects, such as BOINC. Applications to be deployed on a BOINC infrastructure need special preparations. However, there are many legacy applications, that have either no source code available or would require too much effort to port. For these applications BOINC provides a wrapper. This wrapper can handle the simple cases and it is configurable, but it can only be used to execute a list of legacy executables (tasks) one after the other. GenWrapper aims to provide a generic solution for wrapping and executing an arbitrary set of legacy applications by utilizing a POSIX like shell scripting environment to describe how the application is to be run and how the work unit should be processed. This is realized by an extended version of BusyBox providing the most common UNIX commands and a POSIX shell interpreter in a single executable with a special applet (BusyBox extension) to make BOINC API functions accessible from the shell on Windows, Linux and Mac OS X platforms. In this paper we present how GenWrapper works and how it can be used to port legacy applications to desktop grid systems.

关键词： Grid computing Application software Wrapping Linux Automation Computer architecture Assembly Middleware XML Ash

来源：评论

学校读者我要写书评

暂无评论

A New Cloaking Method Supporting both K-anonymity and L-diversity for Privacy Protection in Location-Based Service

A New Cloaking Method Supporting both K-anonymity and L-dive...

引用

international symposium on parallel and distributed Processing with Applications, ISPA

作者： Jung-Ho Um Mi-Young Jang Kyoung-Jin Jo Jae-Woo Chan Dept. of Computer Engineering Chonbuk National Univ. Chonju Chonbuk South Korea Chonbuk National University Jeonju Jeollabuk-do KR

In location-based services (LBSs), users send location-based queries to LBS servers along with their exact locations, but the location information of the users can be misused by adversaries. In this regard, there must be a mechanism which can deal with the privacy protection of the users. In this paper, we propose a cloaking method considering both K-anonymity and L-diversity. Our cloaking method creates a minimum cloaking region by finding L number of buildings (L-diversity) and then finds K number of users (K-anonymity). To support it, we use R*-tree based index structures as well as efficient filtering techniques to generate a minimum cloaking region. Finally, we show from our performance analysis that our cloaking method outperforms the existing grid-based cloaking method in terms of the size of cloaking regions and cloaking region creation time.

关键词： Privacy Protection Buildings Filtering Performance analysis Databases distributed processing Application software Concurrent computing distributed computing

来源：评论

学校读者我要写书评

暂无评论

Identifying Useless States in Non-FIFO distributed Computations by Using Pseudo Timestamps

Identifying Useless States in Non-FIFO Distributed Computati...

引用

international symposium on parallel Architectures, Algorithms and Networks (ISPAN)

作者： Lung-Pin Chen Meng-Yuan Ho Jhen-You Hong Department of Computer Science and Information Engineering Tunghai University Taichung Taiwan

In a distributed system, a monitor process collects the execution states and invokes a detection procedure to test and debug the program. This paper investigates the global state analyzing problems for the non-FIFO distributed environments. In this paper, the states unknown to the monitor process are represented by using the pseudo states. Based on this technique, this paper develops an algorithm capable of identifying the maximum number of useless states for the programs run in an non-FIFO distributed environment.

关键词： distributed computing System testing Debugging Computer networks Pervasive computing Computer science Computerized monitoring Detection algorithms Acceleration Logic testing

来源：评论

学校读者我要写书评

暂无评论

A Heuristic for Mapping Virtual Machines and Links in Emulation Testbeds

A Heuristic for Mapping Virtual Machines and Links in Emulat...

引用

international Conference on parallel Processing (ICPP)

作者： Rodrigo N. Calheiros Rajkumar Buyya César A.F. De Rose Pontifical Catholic University of Rio Grande do Sul Porto Alegre Brazil Grid Computing and Distributed Systems (GRIDS) Laboratory Department of Computer Science and Software Engineering University of Melbourne Australia

distributed system emulators provide a paramount platform for testing of network protocols and distributed applications in clusters and networks of workstations. However, to allow testers to benefit from these systems, it is necessary an efficient and automatic mapping of hundreds, or even thousands, of virtual nodes to physical hosts-and the mapping of the virtual links between guests to physical paths in the physical environment. In this paper we present a heuristic to map both virtual machines to hosts and virtual links between virtual machines to paths in the real system. We define the problem we are addressing, present the solution for it and evaluate it in different usage scenarios.

关键词： Virtual machining System testing Switches Grid computing Network topology Cloud computing software testing LAN emulation Wide area networks parallel processing

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

全选清除本页清除全部题录导出标记到“检索档案”

共500页 << < 485 486 487 488 489 490 491 492 493 494 > >>

检索报告对象比较合并检索0

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

电话和邮箱必须正确填写，我们会与您联系确认。

联系人：

所在院系：

联系邮箱：

联系电话：

内蒙古自治区呼和浩特市赛罕区大学西街235号邮编: 010021

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：