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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

236 篇 会议
207 篇 期刊文献
27 册 图书
3 篇 学位论文

馆藏范围

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

日期分布

学科分类号

406 篇 工学
- 350 篇 计算机科学与技术...
- 267 篇 软件工程
- 88 篇 电气工程
- 41 篇 信息与通信工程
- 35 篇 控制科学与工程
- 13 篇 机械工程
- 11 篇 电子科学与技术（可...
- 8 篇 仪器科学与技术
- 6 篇 力学（可授工学、理...
- 5 篇 材料科学与工程（可...
- 4 篇 船舶与海洋工程
- 2 篇 光学工程
- 2 篇 土木工程
- 2 篇 航空宇航科学与技...
- 2 篇 环境科学与工程（可...
- 2 篇 网络空间安全
64 篇 理学
- 43 篇 数学
- 15 篇 物理学
- 14 篇 统计学（可授理学、...
- 3 篇 系统科学
- 2 篇 地球物理学
- 1 篇 化学
34 篇 管理学
- 26 篇 管理科学与工程(可...
- 20 篇 工商管理
- 9 篇 图书情报与档案管...
5 篇 医学
- 4 篇 临床医学
2 篇 教育学
- 2 篇 教育学
1 篇 哲学
- 1 篇 哲学
1 篇 经济学
- 1 篇 应用经济学
1 篇 历史学
- 1 篇 世界史
1 篇 农学

主题

473 篇 multiprogramming
27 篇 operating system...
24 篇 scheduling
21 篇 multiprocessing
21 篇 operating system
18 篇 nasa technical r...
18 篇 (ntrs)
13 篇 time-sharing
11 篇 performance
11 篇 resource allocat...
10 篇 parallel process...
10 篇 user interfaces
9 篇 memory managemen...
9 篇 computer graphic...
9 篇 processor alloca...
8 篇 paging
8 篇 program behavior
8 篇 real-time system...
8 篇 performance eval...
8 篇 virtual memory

机构

4 篇 massachusetts in...
4 篇 ibm thomas j. wa...
4 篇 sun microsyst in...
3 篇 carnegie-mellon ...
3 篇 university of pi...
3 篇 univ minnesota d...
2 篇 ecole normale su...
2 篇 princeton univer...
2 篇 massachusetts in...
2 篇 research centre ...
2 篇 eindhoven univ t...
2 篇 mit cambridge ma...
2 篇 departamento de ...
2 篇 institut für inf...
2 篇 technological un...
2 篇 mississippi stat...
2 篇 penn state univ ...
2 篇 waseda univ dept...
2 篇 univ rochester d...
2 篇 univ texas dept ...

作者

7 篇 denning peter j.
4 篇 lilja dj
3 篇 hansen per brinc...
3 篇 trivedi ks
3 篇 he yuxiong
3 篇 yue kk
3 篇 chandy km
3 篇 dowdy lawrence w...
3 篇 dijkstra edsger ...
3 篇 habermann an
3 篇 leiserson charle...
2 篇 kameda h
2 篇 markatos e.
2 篇 kuehner cj
2 篇 wirth n
2 篇 luk wayne
2 篇 lorenzon arthur ...
2 篇 schwarzrock jana...
2 篇 denholm stewart
2 篇 amasaki sousuke

语言

449 篇 英文
22 篇 其他
2 篇 中文

检索条件"主题词=multiprogramming"

共 473 条记录，以下是201-210 订阅

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

详细简洁

排序：

A Transform Domain Modular Approach for Facial Recognition Using Different Representations and Windowing Techniques 57

A Transform Domain Modular Approach for Facial Recognition U...

引用

57th IEEE International Midwest Symposium on Circuits and Systems (MWSCAS)

作者： Chehata, Ramy C. G. Mikhael, Wasfy B. Atia, George Univ Cent Florida Dept Elect Engn & Comp Sci Orlando FL 32816 USA

ISBN: (纸本)9781479941322

A face recognition algorithm based on a newly developed Transform Domain Modular (TDM) approach is proposed. In this approach, the spatial faces are divided into smaller sub-images, which are processed using non-overlapping and overlapping windows. Each image is subsequently transformed using a compressing transform such as the two dimensional discrete cosine transform. This produces the TDM2D and the TDM-Dia based on two-dimensional and diagonal representations of the data, respectively. The performance of this approach for facial image recognition is compared with the state of the art successful techniques. The test results, for noise free and noisy images, yield higher than 97.5% recognition accuracy. The improved recognition accuracy is achieved while retaining comparable or better computation complexity and storage savings.

关键词： Face Face recognition Principal component analysis Testing Time division multiplexing Training Transforms Facial Recognition Transform time division multiplexing Face Face principal components analysis Functional training Image recognition window method state of the art face recognition algorithm multiprogramming Representation of data modular approach

来源：评论

学校读者我要写书评

暂无评论

High-level data parallel programming in promoter

High-level data parallel programming in promoter

引用

2nd International Workshop on High-Level Parallel Programming Models and Supportive Environments / 11th International Parallel Processing Symposium

作者： Besch, M Bi, H Enskonatus, P Heber, G Wilhelmi, M RWCP Massively Parallel Systems GMD Lab Berlin Berlin Germany

ISBN: (纸本)0818678836

Implementing realistic scientific applications on parallel platforms requires a high-level, problem-adequate and flexible programming environment. The hybrid system PROMOTER pursues a two-level approach allowing easy and flexible programming at both language and library levels. The core concept of PROMOTER's language model is its highly abstract and unified concept of data and communication structures. The paper briefly addresses the programming model, but focuses on implementation aspects of the compiler and runtime system. Finally, performance results are given, evaluating the efficiency of the PROMOTER system.

关键词： multiprogramming

来源：评论

学校读者我要写书评

暂无评论

Performance evaluation of macrodataflow computation on shared memory multiprocessors

Performance evaluation of macrodataflow computation on share...

引用

IEEE Pacific Rim Conference on Communications, Computers, and Signal Processing

作者： AIDA, K IWASAKI, K KASAHARA, H NARITA, S WASEDA UNIV DEPT ELECT ENGNSHINJUKU KUTOKYO 169JAPAN

ISBN: (纸本)0780325540

The coarse grain parallel processing on shared memory multiprocessor systems has been implemented using multi-tasking. However, this scheme has drawbacks such as difficulty in the extraction of parallelism among coarse grain tasks by ordinary users and large dynamic scheduling overhead caused by operating system calls or run-time library calls. On the other hand, in the proposed Fortran macro-dataflow computation scheme, the compiler automatically generates coarse grain tasks called macrotasks, exploits parallelism among macrotasks, and generates a dynamic scheduling routine that schedules macrotasks to processors at run-time with small overhead. This paper presents performance evaluation of macrodataflow computation on shared memory multiprocessor systems. The results on four processors of a KSR1 show that macrodataflow computation reduces execution time to 1/2.81 of sequential execution time while an ordinary multi-threading reduces execution time to 1/2.19 of sequential execution time.

关键词： multiprogramming

来源：评论

学校读者我要写书评

暂无评论

Adaptive Work Stealing with Parallelism Feedback 07

Adaptive Work Stealing with Parallelism Feedback

引用

ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming

作者： Agrawal, Kunal He, Yuxiong Leiserson, Charles E. MIT Comp Sci & Artificial Intelligence Lab Cambridge MA 02139 USA

ISBN: (纸本)9781595936028

We present an adaptive work-stealing thread scheduler, A-STEAL, for fork-join multithreaded jobs, like those written using the Cilk multithreaded language or the Hood work-stealing library. The A-STEAL algorithm is appropriate for large parallel servers where many jobs share a common multiprocessor resource and in which the number of processors available to a particular job may vary during the job's execution. A-STEAL provides continual parallelism feedback to a job scheduler in the form of processor requests, and the job must adapt its execution to the processors allotted to it. Assuming that the job scheduler never allots any job more processors than requested by the job's thread scheduler, A-STEAL guarantees that the job completes in near-optimal time while utilizing at least a constant fraction of the allotted processors. Our analysis models the job scheduler as the thread scheduler's adversary, challenging the thread scheduler to be robust to the system environment and the job scheduler's administrative policies. We analyze the performance of A-STEAL using "trim analysis," which allows us to prove that our thread scheduler performs poorly on at most a small number of time steps, while exhibiting near-optimal behavior on the vast majority. To be precise, suppose that a job has work T-1 and span (critical-path length) T-infinity. On a machine with P processors, A-STEAL completes the job in expected O(T-1/(P) over tilde + T-infinity + L lg P) time steps. where L is the length of a scheduling quantum and (P) over tilde denotes the O(T-infinity + L lg P)-trimined availability. This quantity is the average of the processor availability over all but the O(T-infinity + L lg P) time steps having the highest processor availability. When the job's parallelism dominates the trimmed availability, that is, (P) over tilde << T-1/T-infinity, the job achieves nearly perfect linear speedup. Conversely, when the trimmed mean dominates the parallelism, the asymptotic running time

关键词： Adaptive scheduling Adversary Critical path Distributed scheduling Job scheduling Multithreaded Languages Multiprocessing multiprogramming Parallelism feedback Parallel computation Processor allocation Space sharing Span Thread scheduling Two-level scheduling Trim analysis Work Work stealing

来源：评论

学校读者我要写书评

暂无评论

Investigation of Scratchpad Memory for Preemptive Multitasking

Investigation of Scratchpad Memory for Preemptive Multitaski...

引用

33rd IEEE Real-Time Systems Symposium

作者： Whitham, Jack Davis, Robert I. Audsley, Neil C. Altmeyer, Sebastian Maiza, Claire Univ York Real Time Syst Grp York YO10 5DD N Yorkshire England

ISBN: (纸本)9780769548692;9781467330985

We present a multitasking scratchpad memory reuse scheme (MSRS) for the dynamic partitioning of scratchpad memory between tasks in a preemptive multitasking system. We specify a means to compute the worst-case response time (WCRT) and schedulability of task sets executed using MSRS. Our scratchpad-related preemption delay (SRPD) is an analog of cache-related preemption delay (CRPD), proposed in previous work as a way to compute the worst-case cost imposed upon a preempted task by preemption in a multitasking system. Unlike CRPD, however, SRPD is independent of the number of tasks and the local memory size. We compare SRPD with CRPD by experiment and determine that neither dominates the other, i.e. either may be better for certain task sets. However, MSRS leads to improved schedulability versus cache when contention for local memory space is high, either because the local memory size is small, or because the task set is large, provided that the cost of loading blocks from external memory to scratchpad is similar to the cost of loading blocks into cache.

关键词： cache storage multiprogramming

来源：评论

学校读者我要写书评

暂无评论

System Level Speedup Oriented Cache Partitioning for Multi-programmed Systems

System Level Speedup Oriented Cache Partitioning for Multi-p...

引用

6th IFIP International Conference on Network and Parallel Computing

作者： Suo, Guang Yang, Xue-jun Natl Univ Def Technol Sch Comp Natl Lab Paralleling & Distributed Proc Changsha 410073 Hunan Peoples R China

ISBN: (纸本)9781424449903

In a chip-multiprocessor with a shared cache structure, the last level cache is shared by multiple applications executing simultaneously. The competing accesses from different applications degrade the system performance, resulting in non-predicting executing time. Cache partitioning techniques partition the shared cache for multiple applications. Traditional cache partitioning mechanisms such as Utility-based Cache Partitioning (UCP) and IPC-based Cache Partitioning (IPC-CP), aim to optimize the objective (for example, instruction per cycle or miss rate) that is appealing for individual application. However, the performances of multi-programmed systems are usually characterized by the number of applications finished during certain interval. This paper investigates System Level Speedup oriented Cache Partitioning (SLS-CP), which is used to maximize total speedup of the system. Like UCP and IPC-CP, the inputs of SLS-CP are current performance status and misses of all the possible partitions, and the outputs of SLS-CP are optimum cache partitions for multiprogrammed workloads. Our evaluation, on top of a two cores CMP processor with 8 multi-programmed workloads shows that SLS-CP improves system level speedup and fairness over UP and IPC-CP.

关键词： multiprogramming

来源：评论

学校读者我要写书评

暂无评论

THE PROBLEMS OF INTERACTIVE MULTIPROCESSING

THE PROBLEMS OF INTERACTIVE MULTIPROCESSING

引用

作者： Barrie Trevor Jones Imperial College London

学位级别：博士

The major objective of this thesis is to set out feasible methods for both detecting and avoiding those problems which are peculiar to tasking. In order to do this the problems are first defined and, then, ways of dea... 详细信息

关键词： parallel tasks tasking multiprocessing multiprogramming interaction time-sharing mother task daughter task orphan task parallel access

来源：评论

学校读者我要写书评

暂无评论

Resource-Constrained Spatial Multi-Tasking for Embedded GPU

Resource-Constrained Spatial Multi-Tasking for Embedded GPU

引用

IEEE International Conference on Consumer Electronics (ICCE)

作者： Joo, Woohyun Shin, Dongkun Samsung Elect Digital Media & Commun R&D Ctr Suwon South Korea Sungkyunkwan Univ Sch Informat & Commun Engn Suwon South Korea

ISBN: (纸本)9781479912919

For recent smart devices, the embedded GPU is an indispensable unit and multi-task scheduling on the GPU becomes an important issue. To prevent the performance degradation on foreground GPU task by competing background GPU tasks, we propose a novel spatial multi-tasking which limits the number of available GPU cores for each task based on its priority. The proposed algorithm improved the performance of high priority task by up to 14% over the temporal budget based multi-tasking.

关键词： graphics processing units multiprogramming performance evaluation processor scheduling embedded GPU cores graphics processing unit multitask scheduling performance degradation prevention resource-constrained spatial multitasking smart consumer devices temporal budget based multitasking Educational institutions Electronic mail Graphics processing units Performance evaluation Processor scheduling Smart phones

来源：评论

学校读者我要写书评

暂无评论

Load balancing HPF programs by migrating virtual processors

Load balancing HPF programs by migrating virtual processors

引用

2nd International Workshop on High-Level Parallel Programming Models and Supportive Environments / 11th International Parallel Processing Symposium

作者： Perez, C Ecole Normale Superieure de Lyon Lyon France

ISBN: (纸本)0818678836

This paper explores the integration of load balancing features in the data parallel language HPF targeting semi-regular applications. We show that the HPF virtual processors are good candidates to be the unit of migration. Then, we compare 3 possible implementations and show that threads provide a good trade-off between efficiency and ease of implementation. We finally describe a preliminary implementation. The experimental results, obtained with the Gaussian elimination with partial pivoting ave promising.

关键词： multiprogramming

来源：评论

学校读者我要写书评

暂无评论

SCHEDULING AND PAGE MIGRATION FOR MULTIPROCESSOR COMPUTE SERVERS 6

SCHEDULING AND PAGE MIGRATION FOR MULTIPROCESSOR COMPUTE SER...

引用

6th International Conference on Architectural Support for Programming Languages and Operating Systems

作者： CHANDRA, R DEVINE, S VERGHESE, B GUPTA, A ROSENBLUM, M Computer Systems Laboratory Stanford University Stanford CA

ISBN: (纸本)9780897916608

Several cache-coherent shared-memory multiprocessors have been developed that are scalable and offer a very tight coupling between the processing resources. They are therefore quite attractive for use as compute servers for multiprogramming and parallel application workloads. Process scheduling and memory management, however, remain challenging due to the distributed main memory found on such machines. This paper examines the effects of OS scheduling and page migration policies on the performance of such compute servers. Our experiments are done on the Stanford DASH, a distributed-memory cache-coherent multiprocessor. We show that for our multiprogramming workloads consisting of sequential jobs, the traditional Unix scheduling policy does very poorly. In contrast, a policy incorporating cluster and cache affinity along with a simple page-migration algorithm offers up to two-fold performance improvement. Four our workloads consisting of multiple parallel applications, we compare space-sharing policies that divide the processors among the applications to time-slicing policies can achieve better processor utilization due to the operating point effect, but time-slicing policies benefit strongly from user-level data distribution. Our initial experience with automatic page migration suggests that policies based only on TLB miss information can be quite effective, and useful for addressing the data distribution problems of space-sharing schedulers.

关键词： multiprogramming

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共48页 << < 17 18 19 20 21 22 23 24 25 26 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：