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

Performance analysis of gang scheduling in a distributed system under processor failures

International Journal of Simulation: Systems, Science and Technology 2001年第1期2卷 14-23页

作者： Karatza, Helen D. Department of Informatics Aristotle University of Thessaloniki Thessaloniki Greece

In this paper we study the performance of a distributed system that is subject to hardware failures and subsequent repairs. A special type of scheduling called gang scheduling is considered, under which jobs consist of a number of interacting tasks which are scheduled to run simultaneously on distinct processors. Two different gang scheduling policies used to schedule parallel jobs are examined in two cases: In the blocking case, a job that is blocked due to processor failure keeps all of its assigned processors until the failed processor is repaired. In the nonblocking case, the remaining operable processors can serve other jobs. Furthermore, this paper combines two different I/O scheduling methods with the two gang scheduling policies, so that three policy combinations are used. The impact of the variability in processor service time is also studied. Various degrees of multiprogramming, coefficients of variation of processor service time and failure to repair ratios are examined using simulation techniques. © 2001, UK Simulation Society. All rights reserved.

关键词： multiprogramming

来源：评论

学校读者我要写书评

暂无评论

Branch Prediction and Simultaneous Multithreading 96

Branch Prediction and Simultaneous Multithreading

引用

Proceedings of the 1996 Conference on Parallel Architectures and Compilation Techniques

作者： S. Hily A. Seznec

Abstract: In this paper, we examine the behavior of three of the best performing branch prediction strategies proposed in the literature while executing simultaneously several threads of instructions. Our simulations show that in a multiprogramming environment, if the sizes of the tables (PHT/BTB) are proportional to the number of active threads, there are very few interactions. With parallel workloads, we could have expected a beneficial sharing effect. In fact, it is very dependent an the branch predictors and in the best case, the gains stay very limited. We also show that, for the three predictors, whether in multiprogramming or in parallel processing, if the sizes of the tables are kept small, conflicts in the BTB induce a significant increase in mispredictions. However, for parallel processing with the gshare scheme, the resulting misprediction ratios for 2 or 4 threads stay below those exhibited by 1 thread. Finally, we study the impact of the addition of one Return Address Stack per context and show that a 12-deep stack per thread is sufficient to enhance greatly the accuracy of branch prediction.

关键词： threads simultaneous multithreading multiprogramming branch prediction multiprogramming environment parallel workloads parallel processing

来源：评论

学校读者我要写书评

暂无评论

Teaching operating systems and machine architecture—more on the hands-on laboratory approach 81

Teaching operating systems and machine architecture—more on...

引用

Proceedings of the twelfth SIGCSE technical symposium on Computer science education

作者： Malcolm G. Lane Department of Statistics and Computer Science West Virginia University Morgantown West Virginia

ISBN: (纸本)9780897910361

The “hands-on” laboratory approach to teaching operating systems has been used at West Virginia University since August 1971 [3, 6, 8]. In 1977 a Digital Equipment Corporation (DEC) PDP-11/34 system replaced the IBM 1130 system previously used for the course. The course is now using an (DEC) LSI-11 and is much *** paper focuses on the student projects which are the major part of the course. The “hands-on” laboratory course as currently being taught is discussed and compared to other techniques for teaching operating systems.

关键词： Systems programming Hands-on multiprogramming PDP-11 Operating systems Minicomputer

来源：评论

学校读者我要写书评

暂无评论

Interworking between MS-Windows, PM and X-Windows

Interworking between MS-Windows, PM and X-Windows

引用

IEE Colloquium on Software Tools for Windows-Based Application Development

作者： A.K. Denson Vision Ware Limited Leeds UK

Addresses the area of graphical user interfaces (GUIs) and open systems. In particular, the author talks about tools available that allow one to use GUIs to provide seamless integration between a variety of different open systems architectures. The role of GUIs in the future development of computer applications for open systems is stressed. The interworking of DOS, Unix and their GUIs is discussed.< >

关键词： Computer graphics multiprogramming Open systems Software tools User interfaces

来源：评论

学校读者我要写书评

暂无评论

Graphical Time Warping for Joint Alignment of Multiple Curves 16

Graphical Time Warping for Joint Alignment of Multiple Curve...

引用

Annual Conference on Neural Information Processing Systems

作者： Yizhi Wang David J. Miller Kira Poskanzer Yue Wang Lin Tian Guoqiang Yu Virginia Tech Pennsylvania State University University of California San Francisco University of California Davis

ISBN: (纸本)9781510838819

Dynamic time warping (DTW) is a fundamental technique in time series analysis for comparing one curve to another using a flexible time-warping function. However, it was designed to compare a single pair of curves. In many applications, such as in metabolomics and image series analysis, alignment is simultaneously needed for multiple pairs. Because the underlying warping functions are often related, independent application of DTW to each pair is a sub-optimal solution. Yet, it is largely unknown how to efficiently conduct a joint alignment with all warping functions simultaneously considered, since any given warping function is constrained by the others and dynamic programming cannot be applied. In this paper, we show that the joint alignment problem can be transformed into a network flow problem and thus can be exactly and efficiently solved by the max flow algorithm, with a guarantee of global optimality. We name the proposed approach graphical time warping (GTW), emphasizing the graphical nature of the solution and that the dependency structure of the warping functions can be represented by a graph. Modifications of DTW, such as windowing and weighting, are readily derivable within GTW. We also discuss optimal tuning of parameters and hyperparameters in GTW. We illustrate the power of GTW using both synthetic data and a real case study of an astrocyte calcium movie.

关键词： Warping time series analysis Curves network flow multiprogramming Joints Function Alignment

来源：评论

学校读者我要写书评

暂无评论

Visual parallel programming with Visper

Proceedings of the Conference on High Performance Computing ...

引用

Proceedings of the Conference on High Performance Computing on the Information Superhighway, HPC Asia'97 1997年 541-546页

作者： Stankovic, Nenad Zhang, Kang Macquarie Univ Sydney

Although the processing power and cost-performance benefits of parallel systems are attractive, it is widely accepted that current methods of writing programs for these computers are inadequate. The reason is that the higher the abstraction to describe computations, the more difficult it gets to present parallelism, communication and synchronization. This paper describes a new tool, Visper for development of parallel programs. It provides an environment that graphically correlates the control and data flow aspects, in a Process Communication Graph (PCG), without a need for complex textual annotation. It can also express static and run-time communication and replication structures. Our approach is based upon combining the levels of abstraction at which parallel programs are expressed and moving to compositional programming. Ready access to these abstractions is provided by a flexible graphical user interface. In Visper, both ease of preparation and compilation of graphical information to textual code are enabled.

关键词： multiprogramming

来源：评论

学校读者我要写书评

暂无评论

Efficient CPU Scheduling Algorithm Using Fuzzy Logic

Efficient CPU Scheduling Algorithm Using Fuzzy Logic

引用

2012 International Conference on Computer Technology and Science(ICCTS 2012)

作者： Puneet Kumar Varshney Nadeem Akhtar M Faridul Haque Siddiqui Zakir Hussain College of Engineering and Technology Aligarh Muslim University AligarhIndia

For using an operating system’s resources more efficiently,multiprogramming plays an important *** for multiprogramming to take place,scheduling plays a pivotal *** policy of deciding which processes to run at a given time should attempt to maximize throughput,minimize latency,prevent process starvation *** techniques are present to perform the said *** this paper a new improved scheduling algorithm technique based on Fuzzy Logic has been *** proposed algorithm has been implemented and compared with the existing FCFS and Round *** Fuzzy Logic has been used to decide a value for time quantum that is neither too large nor too small such that every process has reasonable response time and the throughput of the system is not decreased due to unnecessary context switches.

关键词： multiprogramming scheduling process Fuzzy Logic FCFS Round Robin

来源：评论

学校读者我要写书评

暂无评论

DATA RATE AND DYNAMIC RANGE COMPRESSION OF MEDICAL IMAGES: WHICH ONE GOES FIRST?

DATA RATE AND DYNAMIC RANGE COMPRESSION OF MEDICAL IMAGES: W...

引用

IEEE International Conference on Image Processing

作者： Shahrukh Athar Hojatollah Yeganeh Zhou Wang Dept. of Electrical & Computer Engineering University of Waterloo

ISBN: (纸本)9781479983407

Advances in the field of medical imaging have led to an immense increase in the volume of images being acquired. A fast growing application is to enable physicians to access image data remotely from any viewing device. This casts new challenges for data rate compression. Meanwhile medical images typically have High Dynamic Range (HDR), which needs to be transformed to Low Dynamic Range (LDR) through a so-called "windowing" operation in order for them to be viewed on standard displays to best visualize specific types of content such as tissues or bone structures. This leads to a basic question: Should data compression be performed before windowing or vice versa? Answering this question needs domain knowledge and also requires comparing HDR and LDR images in terms of objective measures, which has only recently become possible. In this paper, we compare the two alternative schemes by using a recently proposed structural fidelity measure. Our study suggests that data compression followed by windowing delivers better performance than the other alternative.

关键词： Medical image compression High dynamic range Windowing Tone mapping Image quality assessment Structural fidelity multiprogramming Data compression Medical imaging images HIGH DYNAMIC RANGE Data transfer rates Image compression Quality assessment LAND DISPOSAL RESTRICTIONS

来源：评论

学校读者我要写书评

暂无评论

Improving the efficiency of graph algorithm executions on high-performance computing

引用

CONCURRENCY AND COMPUTATION-PRACTICE & EXPERIENCE 2023年第18期35卷

作者： Moori, Marcelo K. Rocha, Hiago Mayk G. de A. Schwarzrock, Janaina Lorenzon, Arthur F. Beck, Antonio Carlos S. Univ Fed Rio Grande do Sul Inst Informat Porto Alegre RS Brazil Fed Univ Pampa Optimizat Syst Lab Alegrete RS Brazil

The growing need for extracting information from large graphs has been pushing the development of parallel graph algorithms. However, the highly irregular structure of the real-world graphs limits the performance and energy improvements of graph applications. In this paper, we show that, in most cases, using all the available cores of the multiprocessor is not the best option in terms of the aforementioned non-functional requirements. Based on that, we propose GraphKat, a framework that enables the simultaneous processing of several algorithms/graphs instead of executing them serially (i.e., one after another), increasing efficiency in terms of performance and energy. GraphKat works in two steps: (i) it characterizes the graph applications with a specific number of threads based on their efficiency levels;and (ii) it defines the execution order of all graph applications in the target system. Experimental results on three multicore processors (Intel and AMD) show that GraphKat improves the overall system's efficiency related to performance (up to 434.26x$$ 434.26\times $$) and energy-saving (up to 245.21x$$ \times $$), and reduces the graph applications' execution time (up to 17.70x$$ 17.70\times $$) and energy consumption (up to 6.64x$$ \times $$) compared to the default execution of parallel applications on HPC systems.

关键词： graph analytics parallel graph processing multiprogramming system efficiency energy-saving

来源：评论

学校读者我要写书评

暂无评论

Hankel-based Unsupervised Anomaly Detection

Hankel-based Unsupervised Anomaly Detection

引用

American Control Conference

作者： Korkut Bekiroglu Ali Tekeoglu Bruno Andriamanalimanana Saumendra Sengupta Chen-Fu Chiang Jorge Novillo Electrical Engineering Department SUNY Polytechnic Institute Canadian Institute for Cybersecurity University of New Brunswick Computer Science Department SUNY Polytechnic Institute

ISBN: (数字)9781538682661

ISBN: (纸本)9781538682678

Embedding of data into a normed vector space or linear manifold constitutes a fundamental approach in machine learning. A generalization is embedding into a metric space, where the distance is not induced by a norm. This paper explores the embedding of a time series into a topological metric space of Hankel matrices. The rank metric, along with a windowing scheme, is used to design a score and a detection method, for the purposes of anomaly identification. Assuming that the non-anomalous behavior can be represented as a linear combination of a finite number of frequencies, the rank metric can be used to measure the number of frequency changes in realtime to detect the anomalies. Accordingly, the Hankel matrix rank is used as a metric to develop a Hankel-based unsupervised Anomaly Detection (HAD) algorithm. Extensive experiments are conducted to test the proposed method on the Numenta anomaly benchmark dataset, as well as artificially generated random time-series data. Results show that the proposed HAD method is promising with respect to anomaly detection precision and computational performance.

关键词： anomaly outlier Hankel matrix windowing anomaly score Numenta Hankel matrices anomaly detection multiprogramming outliers anomaly embedding metric space inspection methods computational performance

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：