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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

414 篇 会议
132 篇 期刊文献
11 册 图书

馆藏范围

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

日期分布

学科分类号

295 篇 工学
- 228 篇 计算机科学与技术...
- 162 篇 软件工程
- 59 篇 信息与通信工程
- 43 篇 控制科学与工程
- 29 篇 电气工程
- 19 篇 生物工程
- 18 篇 机械工程
- 16 篇 动力工程及工程热...
- 15 篇 电子科学与技术（可...
- 9 篇 力学（可授工学、理...
- 9 篇 环境科学与工程（可...
- 7 篇 生物医学工程（可授...
- 6 篇 仪器科学与技术
- 6 篇 交通运输工程
- 6 篇 网络空间安全
- 5 篇 农业工程
113 篇 理学
- 74 篇 数学
- 28 篇 系统科学
- 21 篇 生物学
- 20 篇 统计学（可授理学、...
- 15 篇 物理学
- 10 篇 化学
83 篇 管理学
- 60 篇 管理科学与工程(可...
- 36 篇 工商管理
- 28 篇 图书情报与档案管...
7 篇 经济学
- 7 篇 应用经济学
7 篇 法学
- 5 篇 社会学
6 篇 医学
- 5 篇 基础医学(可授医学...
- 5 篇 临床医学
5 篇 农学
- 5 篇 作物学
4 篇 教育学
1 篇 文学

主题

61 篇 computer science
47 篇 grid computing
44 篇 laboratories
39 篇 distributed comp...
31 篇 application soft...
28 篇 computational mo...
27 篇 resource managem...
27 篇 cloud computing
26 篇 quality of servi...
24 篇 concurrent compu...
24 篇 processor schedu...
23 篇 computer network...
21 篇 computer archite...
18 篇 peer to peer com...
17 篇 software enginee...
17 篇 bandwidth
16 篇 scheduling algor...
15 篇 algorithm design...
15 篇 middleware
15 篇 delay

机构

27 篇 grid computing a...
10 篇 institute of par...
10 篇 science and tech...
9 篇 college of compu...
9 篇 cloud computing ...
9 篇 national laborat...
7 篇 grid computing a...
7 篇 ieee
7 篇 department of co...
7 篇 parallel and dis...
6 篇 parallel and dis...
6 篇 intelligent dist...
6 篇 service oriented...
5 篇 school of electr...
5 篇 department of co...
5 篇 parallel and dis...
5 篇 national laborat...
5 篇 distributed syst...
4 篇 science and tech...
4 篇 key laboratory o...

作者

54 篇 rajkumar buyya
20 篇 buyya rajkumar
12 篇 zhigang luo
12 篇 li kuan-ching
11 篇 naiyang guan
11 篇 chen haibo
11 篇 yang chao-tung
10 篇 ismail leila
10 篇 fei-yue wang
10 篇 materwala huned
10 篇 a. boukerche
8 篇 dustdar schahram
8 篇 kuan-ching li
8 篇 xuhui huang
7 篇 liu jie
7 篇 wang zhaoguo
6 篇 xiang zhang
6 篇 hangjun zhou
6 篇 li jinyang
6 篇 chao-tung yang

语言

544 篇 英文
6 篇 中文
5 篇 其他
1 篇 法文
1 篇 葡萄牙文

检索条件"机构=Parallel and Distributed Systems Laboratory Department of Computer Science"

共 557 条记录，以下是501-510 订阅

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

详细简洁

排序：

Optimal scheduling of iterative data-flow programs onto multiprocessors with non-negligible interprocessor communication 7th

Optimal scheduling of iterative data-flow programs onto mult...

引用

7th International Conference on High-Performance Computing and Networking, HPCN Europe 1999

作者： Antony Louis Piriyakumar, D. Levi, Paul Siva Ram Murthy, C. Institute of Parallel and Distributed High-Performance Systems University of Stuttgart Stuttgart70565 Germany Department of Computer Science and Engineering Indian Institute of Technology Chennai600 036 India

ISBN: (纸本)3540658211

The problem of optimal compile-time multiprocessor scheduling of iterative data-flow programs with feedback (delay elements) is addressed in this paper, unlike the earlier studies assumed the availability of a large number of processors and complete interconnection among them along with the interprocessor communication (IPC) to be non-negligible to be more realistic. We first explain the effects of including IPC in non-overlapped, overlapped, fully-static, and cyclo-static multiprocessor schedules with LMS filter as a realistic example. The effect of IPC in the rate-optimal schedules with the transformation techniques viz. unfolding and retiming in scheduling data-flow programs with optimal unfolding is discussed with an example. We then propose an algorithm, based on the well-known A* algorithm, for optimal scheduling of data-flow programs onto multiprocessors, which uses only minimum number of processors. To alleviate the impediments of large requirements of memory space and CPU time for the optimal scheduling algorithm, we present an effective technique, branch join path isomorphism (BJP) which relies on our previously defined processor isomorphism, task isomorphism, and node isomorphism apart from the lower bound theory and upper bound on the completion time. The schedules produced by our algorithm are superior to those obtained by the earlier algorithms despite considering IPC as non-negligible and also not completely connected multiprocessor systems. © Springer-Verlag Berlin Heidelberg 1999.

关键词： Scheduling

来源：评论

学校读者我要写书评

暂无评论

The SICMA teleteaching trial on ADSL and intranet networks 4th

引用

4th European Conference on Multimedia Applications, Services and Techniques, ECMAST 1999

作者： Cortes, F. Darlayiannis, V. Herreo, M. Kyriakaki, G. Lüling, R. Maragoudakis, Y. Mavraganis, Y. Meyer, K. Pappas, N. Laboratory of Distributed Multimedia Information Systems and Applications Technical University of Crete Greece Department of Mathematics and Computer Science University of Paderborn Germany

ISBN: (纸本)3540660828

The provision of interactive multimedia services, such as video-on-demand, teleshoping and distance learning, to a large number of users, still remains a challenging issue in the multimedia area. Despite of recent technological advances in all levels of the distributed multimedia infrastructure (storage, network, compression, standardization etc..), there is a strong need for feedback from public trials. Trial descriptions and evaluations, by revealing potential system limitations and measuring end user reactions, will provide valuable input towards the large-scale deployment of such services. In this paper, we present the teleteaching trial that was held at the end of 1998, at Limburg University (Belgium), in the context of ACTS SICMA project. We describe in detail the overall architecture and present results/implementation experiences for the parts of the system, putting the main emphasis on the server. We present technical integration issues between DAVIC and Internet server protocols (RTSP, DSM-CC etc..), and discuss the overall trial results. © Springer-Verlag Berlin Heidelberg 1999.

关键词： Multimedia services

来源：评论

学校读者我要写书评

暂无评论

CPU resource control for mobile programs

CPU resource control for mobile programs

引用

International Symposium on Agent systems and Applications. International Symposium on Mobile Agents

作者： M. Lal R. Pandey Parallel and Distributed Computing Laboratory Computer Science Department University of California Davis CA USA

There is considerable interest in developing runtime infrastructures for programs that can migrate from one host to another. Mobile programs are appealing because they support efficient utilization of network resources and extensibility of information servers. This paper presents a scheduling scheme for allocating resources to a mix of real-time and non real-time mobile programs. Within this framework, both mobile programs and hosts can specify constraints on how CPU should be allocated. On the basis of the constraints, the scheme constructs a scheduling graph on which it applies several scheduling algorithms. In case of conflicts between mobile program and host specified constraints, the schemes implement a policy that resolves the conflicts in favor of the host. The resulting scheduling scheme is adaptive, flexible, and enforces both program and host specified constraints.

关键词： Scheduling algorithm Resource management Java Web pages Government Security Concurrent computing Laboratories computer science Runtime

来源：评论

学校读者我要写书评

暂无评论

LOTEC: a simple DSM consistency protocol for nested object transactions 99

LOTEC: a simple DSM consistency protocol for nested object t...

引用

Proceedings of the eighteenth annual ACM symposium on Principles of distributed computing

作者： Peter Graham Yahong Sui Parallel and Distributed Systems Lab Department of Computer Science University of Manitoba Winnipeg Manitoba Canada R3T 2N2

来源：评论

学校读者我要写书评

暂无评论

Data management for large-scale scientific computations in high performance distributed systems

Data management for large-scale scientific computations in h...

引用

International Symposium on High Performance distributed Computing

作者： A. Choudhary M. Kandemir H. Nagesh J. No X. Shen V. Taylor S. More R. Thakur Center for Parallel and Distributed Computing Department of Electrical and Computer Engineering Northwestern University Evanston IL USA Mathematics and Computer Science Division Argonne National Laboratory Argonne IL USA

With the increasing number of scientific applications manipulating huge amounts of data, effective data management is an increasingly important problem. Unfortunately, so far the solutions to this data management problem either require deep understanding of specific storage architectures and file layouts (as in high-performance file systems) or produce unsatisfactory I/O performance in exchange for ease-of-use and portability (as in relational DBMSs). In this paper we present a new environment which is built around an active meta-data management system (MDMS). The key components of our three-tiered architecture are user application, the MDMS, and a hierarchical storage system (HSS). Our environment overcomes the performance problems of pure database-oriented solutions, while maintaining their advantages in terms of ease-of-use and portability. The high levels of performance are achieved by the MDMS, with the aid of user-specified directives. Our environment supports a simple, easy-to-use yet powerful user interface, leaving the task of choosing appropriate I/O techniques to the MDMS. We discuss the importance of an active MDMS and show how the three components, namely application, the MDMS, and the HSS, fit together. We also report performance numbers from our initial implementation and illustrate that significant improvements are made possible without undue programming effort.

关键词： Large-scale systems distributed computing High performance computing Data visualization Engineering management Concurrent computing Relational databases Art Data analysis Image analysis

来源：评论

学校读者我要写书评

暂无评论

On the efficient sequential and distributed generation of very large Markov chains from stochastic Petri nets

On the efficient sequential and distributed generation of ve...

引用

International Workshop on Petri Nets and Performance Models (PNPM)

作者： B. Haverkort A. Bell H. Bohnenkamp Department of Computer Science Laboratory for Distributed Systems Rheinisch-Westfälische Technische Hochschule Aachen University Aachen Germany

In this paper we present efficient techniques for the generation of very large continuous-time Markov chains (CTMCs) specified as stochastic Petri nets (SPNs). In particular, we investigate how the storage efficiency of the reachability graph generation can be improved by using good state coding techniques and by using hashing tables instead of tree-based data structures. These techniques allow us to analyse SPNs with almost 55 million states on a single workstation. The size of the SPNs that can be handled is then further enlarged by using a cluster of workstations. With 16 workstations, connected via a 100 Mbps Ethernet, we can generate reachability graphs with over 400 million states in reasonable time. The presented techniques have been realised in a prototype tool (PARSECS) implemented in C++ using the libraries STL and MPICH. The SPNs to be input to PARSECS are specified using CSPL, known from the tool SPNP. In the paper we present our techniques and study their performance for a number of case studies. We also present comparisons with SPNP.

关键词： distributed control Stochastic processes State-space methods Stochastic systems Workstations Petri nets computer science Laboratories Read only memory Steady-state

来源：评论

学校读者我要写书评

暂无评论

Proxy prefix caching for multimedia streams

Proxy prefix caching for multimedia streams

引用

IEEE Annual Joint Conference: INFOCOM, IEEE computer and Communications Societies

作者： S. Sen J. Rexford D. Towsley Department of Computer Science University of Massachusetts Amherst MA USA AT&T Laboratory-Research Networking and Distributed Systems NJ USA

High latency and loss rates in the Internet make it difficult to stream audio and video without introducing a large playback delay. To address these problems, we propose a prefix caching technique whereby a proxy stores the initial frames of popular clips. Upon receiving a request for the stream, the proxy initiates transmission to the client and simultaneously requests the remaining frames from the server. In addition to hiding the delay, throughput, and loss effects of a weaker service model between the server and the proxy, this novel yet simple prefix caching technique aids the proxy in performing workahead smoothing into the client playback buffer. By transmitting large frames in advance of each burst, workahead smoothing substantially reduces the peak and variability of the network resource requirements along the path from the proxy to the client. We describe how to construct a smooth transmission schedule, based on the size of the prefix, smoothing, and playback buffers, without increasing client playback delay. Experiments with MPEG traces show how a few megabytes of buffer space at the proxy can substantially reduce the bandwidth requirements of variable-bit-rate video. Drawing on these results, we present guidelines for allocating buffer space for each stream, and how to effectively share buffer and bandwidth resources among multiple clients and streams.

关键词： Streaming media Smoothing methods Bandwidth Internet Delay effects Throughput Network servers Video sharing Guidelines Resource management

来源：评论

学校读者我要写书评

暂无评论

A non-blocking recovery algorithm for causal message logging

A non-blocking recovery algorithm for causal message logging

引用

Reliable distributed systems

作者： J.R. Mitchell V.K. Garg Parallel and Distributed Systems Laboratory Department of Electrical and Computer Engineering University of Texas Austin

In the recovery of failed processes in a distributed program, causal logging schemes offer several benefits. These benefits include no rollback of unfailed processes and simple approaches to output commit. Unfortunately, previous approaches to the recovery of multiple simultaneous failures require that the distributed execution be blocked or that recovering processes coordinate. The latter requires assumptions which are not satisfactory. In this paper we present a solution that has neither of these drawbacks.

关键词： History Laboratories Optimization methods computer crashes

来源：评论

学校读者我要写书评

暂无评论

Performance and reliability analysis of computer systems: An example-based approach using the sharpe software package

引用

Performance Evaluation 1998年第3期32卷 231-233页

作者： Boudewijn R. Haverkort RWTH-Aachen Department of Computer Science Laboratory for Distributed Systems D-52056 Aachen Germany

来源：评论

学校读者我要写书评

暂无评论

The prototype of continuous media file system, CrownFS

The prototype of continuous media file system, CrownFS

引用

International Conference on Information Networking

作者： Se-Jin Hwang Jin-Uok Kim Myong-Soon Park Oh-Young Kwon Tae-Geun Kim Computer Systems Laboratory Computer Science Department Korea University Seoul South Korea Distributed Computing Laboratory Network Computing Department Systems Engineering Research Institute Daejeon South Korea

ISBN: (纸本)0818672250

Currently, many multimedia or continuous media server system is under development on top of either workstations or high-end PCs clustered with high speed networking facilities. In this paper we introduce Crown, a continuous media server on clustered high performance PCs with Myrinet, fast network switching equipment, and then address CrownFS, a file system on top of Crown, to offer continuous media streams to many subscribers at the same time. For easy and rapid tuning of the performance of CrownFS, we prototyped it. Prototyping requires less efforts and costs than direct implementation. Also, more reliable system optimization is obtainable rather than simulation. By using the prototype, we measured the scalability of CrownFS according to disk access strategies.

关键词： Prototypes File systems Streaming media Network servers Personal communication networks Multimedia systems Workstations High-speed networks File servers Costs

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共56页 << < 47 48 49 50 51 52 53 54 55 56 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：