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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

291 篇 会议
9 篇 期刊文献
3 册 图书

馆藏范围

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

日期分布

学科分类号

224 篇 工学
- 216 篇 计算机科学与技术...
- 149 篇 软件工程
- 58 篇 信息与通信工程
- 12 篇 电气工程
- 6 篇 生物工程
- 4 篇 机械工程
- 3 篇 化学工程与技术
- 3 篇 生物医学工程（可授...
- 2 篇 电子科学与技术（可...
- 1 篇 仪器科学与技术
- 1 篇 控制科学与工程
- 1 篇 安全科学与工程
27 篇 理学
- 18 篇 数学
- 8 篇 生物学
- 3 篇 化学
- 3 篇 统计学（可授理学、...
- 2 篇 物理学
- 1 篇 系统科学
15 篇 管理学
- 13 篇 管理科学与工程(可...
- 5 篇 工商管理
- 3 篇 图书情报与档案管...
2 篇 法学
- 2 篇 社会学

主题

33 篇 cloud computing
16 篇 parallel computi...
11 篇 parallel process...
11 篇 distributed comp...
11 篇 distributed comp...
9 篇 computer archite...
9 篇 computational mo...
8 篇 parallel program...
8 篇 resource managem...
8 篇 distributed syst...
7 篇 peer to peer com...
7 篇 optimization
7 篇 high performance...
6 篇 fault tolerance
6 篇 educational inst...
6 篇 servers
6 篇 real-time system...
6 篇 protocols
6 篇 performance eval...
6 篇 gpu

机构

3 篇 a*star institute...
3 篇 topic committee ...
2 篇 univ adelaide sc...
2 篇 univ texas dept ...
2 篇 washington univ ...
2 篇 school of comput...
2 篇 laria laboratoir...
2 篇 guizhou universi...
2 篇 guizhou universi...
2 篇 beihang univ sta...
2 篇 graduate school ...
2 篇 los alamos natl ...
2 篇 tsinghua univers...
2 篇 univ calif san d...
2 篇 department of co...
2 篇 scripps res inst...
2 篇 kth royal inst t...
2 篇 natl univ def te...
2 篇 college of compu...
2 篇 kent state univ ...

作者

5 篇 li xiaorong
3 篇 xiaorong li
2 篇 seme david
2 篇 kanagasabai raja...
2 篇 cong guojing
2 篇 riccardo loti
2 篇 le duy ngan
2 篇 putchong uthayop...
2 篇 dongarra jack
2 篇 motomura shinich...
2 篇 taufer m
2 篇 ta nguyen binh d...
2 篇 kawamura takao
2 篇 vlassov vladimir
2 篇 kerbyson dj
2 篇 bader david a.
2 篇 tziritas nikos
2 篇 wu weigang
2 篇 liu jie
2 篇 coddington pd

语言

303 篇 英文

检索条件"任意字段=18th International Conference on Parallel and Distributed Computing Systems, PDCS 2005"

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

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

详细简洁

排序：

A distributed peer-to-peer grid scheduler

A distributed peer-to-peer grid scheduler

引用

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

作者： Liu, Cong Baskiyar, Sanjeev Wang, Chengjun Auburn Univ Auburn AL 36849 USA

ISBN: (纸本)9780889866386

In a grid computing environment, dynamicity, and geographically distributed sites, make task scheduling problems challenging to solve. It is hard for a local site to obtain precise real-time information about other sites given that specific information on a site such as load and computing resources may change rapidly. Moreover, in data grid environment, large scale data intensive applications make scheduling problems even more challenging since both computational and data storage resources must be taken into consideration. In this paper we propose an innovative peer-to-peer scheduler to solve these problems. this scheduler is distributed and scalable. We used simulation to evaluate the performance of the scheduler under different circumstances, such as different number of hops to search suitable sites and different number of incoming tasks. Results show that our scheduler can successfully schedule around 75% of incoming tasks within their deadlines in average. For computation-intensive tasks, it can successfully schedule more than 90% of incoming tasks.

关键词： data grid peer-to-peer scheduler distributed scheduling

来源：评论

学校读者我要写书评

暂无评论

parallel Implementation of Shallow Water Model on distributed Memory Architectures 20

Parallel Implementation of Shallow Water Model on Distribute...

引用

20th international conference on parallel and distributed computing systems, pdcs 2007

作者： Ganeshamoorthy, K. Silva, K.P.M.K. Ranasinghe, D.N. Wait, R. Department of Computing & Intelligent Systems University of Colombo School of Computing 35 Reid Avenue Colombo-7 Sri Lanka International Science Programme Department of Information Technology Uppsala University Uppsala Sweden

ISBN: (纸本)9781604233926

In this paper, we study the impact of memory architectures, distributed memory (DM) and virtual shared memory (VSM), in the solution of parallel numerical algorithms on a multi-processor nodes cluster. the parallel implementation of the shallow water equations to model the Tsunami effect is chosen to be the case study. Data is partitioned into sub domains, namely a four into three (4 × 3) Grid scheme and a eight into six (8×6) Grid scheme which are used for the parallel implementation of this model. We present four parallel algorithms in each Grid scheme: distributed memory without threads, distributed memory with threads, virtual shared memory without threads, and virtual shared memory with threads. these four parallel algorithms have been implemented on a high performance cluster, connected to the"Nordugrid". Experiments are realized using the Message Passing Interface (MPI) library, the C/Linda, and the Linux pthreads. Subject to available memory, the virtual shared memory version without threads performs best, but as the task is scaled up, the threaded version becomes efficient in both DM and VSM implementations. © 20th international conference on parallel and distributed computing systems, pdcs 2007. All rights reserved.

关键词： Memory architecture

来源：评论

学校读者我要写书评

暂无评论

Efficient support of fine-grained futures in Java

Efficient support of fine-grained futures in Java

引用

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

作者： Zhang, Lingli Krintz, Chandra Soman, Sunil Univ Calif Santa Barbara Dept Comp Sci Santa Barbara CA 93106 USA

ISBN: (纸本)9780889866386

A future is a parallel programming language construct that enables programmers to specify potentially asynchronous computations. We present and empirically evaluate a novel implementation of futures for Java. Our futures implementation is a JVM extension that couples estimates of future computational granularity with underlying resource availability to enable automatic and adaptive decisions of when to spawn futures in parallel or to execute them sequentially. Our system builds from, combines. and extends (i) lazy task creation and (ii) a JVM sampling infrastructure previously used solely for dynamic and adaptive compilation. We empirically evaluate our system using different benchmarks, triggers for automatic spawning of futures, processor availability, and JVM configurations. We show that our future implementation for Java is efficient and scalable for fine-grained Java futures without requiring programmer intervention.

关键词： Java futures fine-grained parallel programming task scheduling profile-guided

来源：评论

学校读者我要写书评

暂无评论

RHT: Supporting range queries in DHT-based P2P systems

RHT: Supporting range queries in DHT-based P2P systems

引用

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

作者： Liu, Lintao Ryu, Kyung Dong Arizona State Univ Dept Comp Sci & Engn Tempe AZ 85287 USA IBM Corp TJ Watson Res Ctr Hawthorne NY 10532 USA

ISBN: (纸本)9780889866386

An efficient range query processing support is required for distributed Hash Table (DHT)-based P2P networks as consistent hashing destroys the inherent order of numeric keys. In this paper, we present a lightweight and efficient mechanism, called Range Hash Tree (RHT), to support range queries on DHTs. In RHT, key space is partitioned into small ranges such that data items within one range can be stored on one node. To quickly resolve a range query, we introduce a scalable encoding algorithm that can represent the key space partitioning status with a small RHT Signature. Compared to other approaches, RHT provides a bounded query delay, which is independent of the size of range query and the number of matching data items. Our experiments show that RHT works efficiently on both uniform and much skewed data distributions.

关键词： range queries distributed Hash Table signature Peer-to-Peer distributed computing

来源：评论

学校读者我要写书评

暂无评论

Smart Replication for In-memory Computations

Smart Replication for In-memory Computations

引用

IEEE 18th international conference on parallel and distributed systems (ICPADS)

作者： Rehmann, Kim-thomas Beineke, Kevin Schoettner, Michael SAP AG Dietmar Hopp Allee 16 D-69190 Walldorf Germany Univ Dusseldorf Kinderklin Stoffwechsellab Inst fur Informatik D-40225 Dusseldorf Germany

ISBN: (纸本)9781467345651;9780769549033

Cloud computing enables diverse new application areas for distributed computing. Many upcoming cloud applications do not fit to simple programming models such as "embarrassing parallelism" but have complex data dependencies and require atomic operations spanning multiple objects. Some large-scale storage systems already implement atomic multi-object operations, but they do not address the complementary problem of efficiently propagating replica updates. In this paper, we present the design and implementation of a smart replication protocol in the ECRAM in-memory storage, which supports atomic multi-object operations. the performance analysis shows that the adaptive mechanism requires much less bandwidth, less memory, and results in improved application performance and responsiveness.

关键词： Consistency distributed transactional memory In-memory data management Replication Replication consistency Consistency (Measurement) data dependency Cache Memory System Cloud computing Surgery Atomicity Responsiveness atomic operation

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

LBF: A performance metric for program reorganization

LBF: A performance metric for program reorganization

引用

18th international conference on distributed computing systems

作者： Eom, H Hollingsworth, JK Univ Maryland Dept Comp Sci College Pk MD 20742 USA

ISBN: (纸本)0780350049

We introduce a new performance metric, called Land Balancing Factor (LDF), to assist programmers with evaluating different tuning alternatives. the LBF metric differs from traditional performance metrics since it is intended To measure the performance implications of a specific toning alternative rather than quantifying where rime is spent in the current version of the program. A second unique aspect of the metric is that it provides guidance about moving work within a distributed or parallel program rather than reducing it. A variation of the LBF metric can also be used to predict the performance impact of changing the underlying network, the LBF metric can be computed incrementally and online during the execution of the program to De tuned We also present a case study that shows that our metric can pr-edict the actual performance gains accurately for a test suite of six programs.

关键词： distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

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

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：