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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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

分类表

所选分类

>> <<

限定检索结果

文献类型

548 篇 会议
12 篇 期刊文献
4 册 图书

馆藏范围

564 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

436 篇 工学
- 413 篇 计算机科学与技术...
- 274 篇 软件工程
- 109 篇 信息与通信工程
- 76 篇 电气工程
- 60 篇 控制科学与工程
- 24 篇 仪器科学与技术
- 20 篇 电子科学与技术（可...
- 10 篇 动力工程及工程热...
- 9 篇 机械工程
- 9 篇 生物医学工程（可授...
- 8 篇 交通运输工程
- 7 篇 生物工程
- 6 篇 土木工程
- 6 篇 安全科学与工程
- 5 篇 建筑学
- 5 篇 网络空间安全
- 4 篇 光学工程
- 3 篇 化学工程与技术
115 篇 理学
- 91 篇 数学
- 13 篇 系统科学
- 12 篇 统计学（可授理学、...
- 10 篇 物理学
- 9 篇 生物学
- 8 篇 化学
- 3 篇 地球物理学
74 篇 管理学
- 50 篇 管理科学与工程(可...
- 40 篇 工商管理
- 35 篇 图书情报与档案管...
7 篇 法学
- 5 篇 社会学
6 篇 经济学
- 6 篇 应用经济学
4 篇 医学
2 篇 农学

主题

42 篇 distributed comp...
32 篇 parallel process...
25 篇 parallel process...
22 篇 distributed comp...
17 篇 parallel algorit...
15 篇 computer archite...
14 篇 parallel computi...
14 篇 cloud computing
12 篇 distributed syst...
11 篇 concurrent compu...
10 篇 message passing
9 篇 fault tolerance
9 篇 data mining
9 篇 computational mo...
8 篇 java
8 篇 scheduling
7 篇 computer science
7 篇 load balancing
7 篇 parallel program...
7 篇 grid computing

机构

3 篇 high-performance...
3 篇 parallel and dis...
3 篇 shanghai jiao to...
3 篇 shanghai jiao to...
3 篇 parallel and dis...
3 篇 univ fed rio gra...
2 篇 high-performance...
2 篇 hpc laboratory c...
2 篇 department of co...
2 篇 washington univ ...
2 篇 institut univers...
2 篇 univ coll dublin...
2 篇 univ seville i3u...
2 篇 univ extremadura...
2 篇 guangxi univ sch...
2 篇 guangxi univ gua...
2 篇 school of comput...
2 篇 university of ch...
2 篇 ibm dublin techn...
2 篇 univ milan milan

作者

5 篇 kuan-ching li
5 篇 li kuan-ching
5 篇 chao-tung yang
5 篇 yang chao-tung
4 篇 gonzalez teofilo...
3 篇 kawamura takao
3 篇 navaux philippe ...
3 篇 kurt rothermel
3 篇 talia domenico
3 篇 zang binyu
3 篇 sugahara kazunor...
3 篇 zhang jilin
3 篇 ohkawa takeshi
3 篇 xia yubin
2 篇 cong guojing
2 篇 jiao han
2 篇 paraboschi stefa...
2 篇 brzezinski krzys...
2 篇 motomura shinich...
2 篇 park joon s.

语言

542 篇 英文
18 篇 其他
2 篇 俄文
2 篇 中文

检索条件"任意字段=19th IASTED International Conference on Parallel and Distributed Computing and Systems"

共 564 条记录，以下是61-70 订阅

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

详细简洁

排序：

Communication-aware parallel Domain Decomposition using Space Filling Curves 19

Communication-aware Parallel Domain Decomposition using Spac...

引用

19th international conference on parallel and distributed computing systems, PDCS 2006

作者： Seal, Sudip Aluru, Srinivas Department of Electrical and Computer Engineering Iowa State University AmesIA50011 United States

ISBN: (纸本)9781604236446

Space filling curves (SFCs) are proximity preserving linearizations of multidimensional data. they are frequently used for parallel domain decomposition in scientific computing applications where interactions occur between elements with physical proximity. the conventional way to affect SFC-based parallel domain decomposition is to take the SFC-linearization and map it to processors in a block distributed fashion. In this paper, we derive closed form formulas for the average nearest neighbor distance along a Z-space filling curve and use this result to show that such a mapping may not be communication efficient. We introduce topology-aware mapping of SFC data to parallel computers and show that SFC data can be partitioned on hypercubes such that communication is restricted to nearest neighbors. © 19th international conference on parallel and distributed computing systems 2006, PDCS 2006. All rights reserved.

关键词： Mapping

来源：评论

学校读者我要写书评

暂无评论

Investigating the replica transfer scheduling problem

Investigating the replica transfer scheduling problem

引用

18th iasted international conference on parallel and distributed computing and systems

作者： Loukopoulos, thanasis Tziritas, Nikos Lampsas, Petros Lalis, Spyros Univ Thessaly Dept Comp & Commun Engn Glavani 37 Volos 38221 Greece

ISBN: (纸本)9780889866386

the Replica Placement Problem (RPP) aims at selecting the nodes for duplicating data objects in order to optimize their access. Even though a lot of work already exists on RPP, the issue of implementing the resulting allocation scheme is typically overlooked. In this paper we introduce the Replica Transfer Scheduling Problem (RTSP), briefly stated as: given a network of servers with limited storage capacitv, a set of data objects and two replication schemes x(old) and X-new, find a schedule of object transfers and deletions for implementing X-old based on X-old with minimum communication cost. Given that this problem is NP-complete, we introduce several different heuristics to solve it, and evaluate them via simulations.

关键词： replica placement replica transfers distributed systems

来源：评论

学校读者我要写书评

暂无评论

A totally distributed iterative scheme for web services addressing and discovery

A totally distributed iterative scheme for web services addr...

引用

19th iasted international conference on parallel and distributed computing and systems

作者： Milanesio, M. Ruffo, G. Schifanella, R. Department of Computer Science University of Turin Torino Italy

ISBN: (纸本)9780889867048

Both web services framework and peer-to-peer networks provide a discovery process, but as current P2P systems focus more on the discovery of content in the form of common files (possibly associated with metadata), a centralized UDDI registry serves content in the form of metadata describing web services. thus, the intersection between P2P and Web services is clear, so that it recently gained lots of interest: there is the need of finding a way to exploit the high potential of web services without paying in terms of scalability or single-point-of-failures. Our aim in this paper is two-fold: on the one hand, we want to present a high level protocol for the addressing and the discovery of web services that is totally decentralized and based on a structured P2P topology. On the other hand, we introduce a way to solve the exact match key-based routing problem, that afflicts structured P2P systems. this model guarantees that all addressed web services will be discovered in a logarithmic number of hops, as it is based on a distributed Hash Table. One of the key innovation is the possibility of customizing the categorization of web services using tags, which are becoming very common in the so called Web 2.0.

关键词： distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

parallelization of multimedia applications on the multi-level computing architecture

Parallelization of multimedia applications on the multi-leve...

引用

18th iasted international conference on parallel and distributed computing and systems

作者： Aydonat, Utku Abdelrahman, Tarek S. Univ Toronto Dept Elect & Comp Engn 100 Coll St Toronto ON Canada

ISBN: (纸本)9780889866386

the Multi-Level computing Architecture (MLCA) is a novel parallel System-on-a-Chip architecture targeted for multimedia applications. It features a top level controller that automatically extracts task level parallelism using techniques similar to how instruction level parallelism is extracted by superscalar processors. this allows the MLCA to support a simple programming model that is similar to sequential programming. In order to assist programmers to easily and efficiently port multimedia applications to the MLCA programming model, a compilation environment is designed. this compilation environment enhances parallelism in MLCA programs by applying three simple code transformations that are based on known compiler optimizations. In this paper, we describe the MLCA architecture, its programming model, its compilation environment and an evaluation of its performance. Our experimental evaluation with three real multimedia applications and an MLCA simulator shows that the MLCA is a viable architecture and scaling speedups can be obtained using the compilation environment with little programmer effort.

关键词： parallel-embedded systems compiler optimizations privatization parallelism enhancement

来源：评论

学校读者我要写书评

暂无评论

Effective Execution Time Estimation for Heterogeneous parallel computing 19

Effective Execution Time Estimation for Heterogeneous Parall...

引用

19th international conference on parallel and distributed computing systems, PDCS 2006

作者： Sun, Junqing Peterson, Gregory D. Electrical and Computer Engineering The University of Tennessee KnoxvilleTN United States

ISBN: (纸本)9781604236446

Finding the expectation of the maximum execution time among parallel processors is crucial in parallel performance evaluation. Unfortunately, current analytical methods for maximum mean calculation cannot be applied to non-identical initial distributions. Even for independent, identical initial distributions, current analytical methods can only apply to certain distributions or are not accurate. Numerical methods are usually too computationally expensive. this paper applies properties of Extreme Values to enable the Effective Maximum Mean Approximation (EMMA) method. When compared to previous methods, it is more general, accurate, convenient and computationally effective. © 19th international conference on parallel and distributed computing systems 2006, PDCS 2006. All rights reserved.

关键词： Numerical methods

来源：评论

学校读者我要写书评

暂无评论

Reliable Scheduling of Stochastic Tasks in Heterogeneous distributed computing systems 19

Reliable Scheduling of Stochastic Tasks in Heterogeneous Dis...

引用

19th international conference on parallel and distributed computing systems, PDCS 2006

作者： Maksoud, Ehab Abdel Ammar, Reda A. Faculty of Engineering Cairo University Egypt Computer Science and Engineering Department University of Connecticut United States

ISBN: (纸本)9781604236446

High performance and reliability are critical requirements for real time systems. Efficient scheduling that assigns tasks of an application to suitable processors in these systems is necessary for achieving high performance. In a previous work, we developed a heuristic algorithm for scheduling a set of independent stochastic tasks in a homogeneous multiprocessor system, to yield the maximum probability for each task to meet its deadline. In this paper, we extend this work to schedule tasks in heterogeneous computing environments. We also present an efficient reliable simple heuristic algorithm to distribute tasks among available processors to maximize simultaneously both of the reliability of the application and the performance measures, such as the success ratio and processor utilization. © 19th international conference on parallel and distributed computing systems 2006, PDCS 2006. All rights reserved.

关键词： Scheduling algorithms

来源：评论

学校读者我要写书评

暂无评论

A Quorum-Based Algorithm for Group Mutual Exclusion 19

A Quorum-Based Algorithm for Group Mutual Exclusion

引用

19th international conference on parallel and distributed computing systems, PDCS 2006

作者： thiare, Ousmane Naimi, Mohamed Department of Computer Science LICP EA2175 University of Cergy-Pontoise France

ISBN: (纸本)9781604236446

Group mutual exclusion is a naturel problem, formulated by Joung, that generalize the classical mutual exclusion problem. In group mutual exclusion a process requests a"session" before entering its critical section;processes are allowed to be in the critical section simultaneously provides they have requested the same session. We propose in this paper a quorum-based algorithm for group mutual exclusion. this algorithm assumes that only one session can be opened at any time, several process can access to the same session, and any requested session can be opened in a finite time. © 19th international conference on parallel and distributed computing systems 2006, PDCS 2006. All rights reserved.

关键词： distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

Memory utilization analysis of Java middleware for distributed real-time and embedded systems

Memory utilization analysis of Java middleware for distribut...

引用

18th iasted international conference on parallel and distributed computing and systems

作者： Qu, Runtao Hirano, Satoshi Ohkawa, Takeshi AIST Natl Inst Adv Ind Sci & Technol Informat Technol Res Inst AIST Tsukuba Cent 2 Tsukuba Ibaraki 3058568 Japan

ISBN: (纸本)9780889866386

distributed object-oriented middleware technologies have been adopted for ubiquitous communicating real-time and embedded systems. Although Java plays an important role in building distributed object-oriented middleware because of its portability and productivity, it is not popularto real-time system developers because it is slow and hard to keep real-timeness due to garbage collection. this paper presents a novel memory classification and measurement approach for modem programming language such as Java to analyze the memory utilization of middleware technologies in order to improve them for embedded systems using limited computing resource. We classified Java memory into four categories such as static, quasi-static, quasi-dynamic and dynamic, and show how to measure the size of each memory. Intensive case studies using popular Java middleware technologies such as Web Services, CORBA, RMI and HORB revealed that reducing the use of dynamic memory has contributed far more to the efficiency and performance than reducing the use of quasi-static and quasi-dynamic memory.

关键词： memory analysis Java middleware distributed system

来源：评论

学校读者我要写书评

暂无评论

Dynamic evolution in a survivable application infrastructure

Dynamic evolution in a survivable application infrastructure

引用

18th iasted international conference on parallel and distributed computing and systems

作者： thorvaldsson, Haraldur D. Goldman, Kenneth J. Washington Univ Dept Comp Sci & Engn St Louis MO 63130 USA

ISBN: (纸本)9780889866386

We describe a highly scalable algorithm for secure system evolution in an infrastructure for widely distributed Byzantine fault-tolerant applications. To maintain high availability, the system and its applications evolve on-line, providing uninterrupted service during installation of upgrades. Installations are made to appear atomic with respect to other installations and application execution steps. Our algorithm guarantees safe installation despite Byzantine faulty replicas and replica groups. An initial phase prepares replica groups for an upgrade, while a second phase triggers the installation of the upgrade by gossip among groups. A simple but novel scheme using secret sharing and Byzantine quorums prevents faulty replicas and replica groups from disrupting or maliciously exploiting installations. Installation message complexity and computational complexity grow linearly with the number of replicas.

关键词： fault tolerant systems dynamic evolution configurable distributed systems Byzantine fault tolerance

来源：评论

学校读者我要写书评

暂无评论

Self-tuned passive testers for grey-box distributed systems with indefinite communication delays

Self-tuned passive testers for grey-box distributed systems ...

引用

international conference on parallel and distributed computing and Networks

作者： Brzezinski, Krzysztof M. Malinski, Norbert Warsaw Univ Technol Inst Telecommun Nowowiejska 15-19 PL-00665 Warsaw Poland

ISBN: (纸本)9780889866379

Passive testing is a technique suitable for continuous, non-intrusive, autonomous testing of qualitative behavioural properties (correctness) of a deployed distributed system. A real passive tester has to face observational uncertainty, which may lead to false verdicts. We submit the novel idea of a self-tuned passive tester, which is able to adapt to a priori unknown, and possibly changing delays in communication channels. We propose the structure and algorithms of a passive tester that "tunes itself" basing solely on its own, locally issued verdicts. this seemingly counter-intuitive principle is shown by simulation to be viable and effective.

关键词： protocols algorithms modelling and simulation testing

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共57页 << < 3 4 5 6 7 8 9 10 11 12 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：