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

IEEE International Conference on parallel and distributed Computing, Applications and Technologies (PDCAT)

The following topics are dealt with: parallel computing; distributed computing; interconnection networks; communication and telecommunication; image processing and computer graphics; access control and authorization; wireless networks and mobile computing; database applications and data mining; parallelizing compilers; parallel/distributed architectures; intelligent computing and neural networks; Internet computing; network routing and communication algorithms; Web technologies; ubiquitous computing systems; task mapping and job scheduling; security protocols; computer networks; formal methods and programming languages; intrusion detection and survivability; grid computing systems; applied cryptography; P2P and ad hoc networks; and reliability and fault-tolerance

关键词：

来源：评论

学校读者我要写书评

暂无评论

Efficient services composition for grid-enabled data-intensive applications

Efficient services composition for grid-enabled data-intensi...

引用

International Symposium on High Performance distributed Computing

作者： T. Glatard J. Montagnat X. Pennec I3S CNRS France Asclepios INRIA France

Grids technologies enable the deployment of complex data-intensive scientific applications. Nonspecific scientific codes may benefit from grid computing capabilities by (i) assembling codes in workflows (code parallelism) and (ii) processing large amounts of data (data parallelism). We designed MOTEUR, a service-based workflow manager, to describe data-intensive scientific applications in a compact framework and to efficiently process the resulting computations by transparently exploiting different parallelism levels. Theoretical performances are analyzed and results are shown based on a real application to medical image databases processing

关键词： parallel processing Middleware Grid computing Concurrent computing Instruments Computer interfaces Engines Assembly image analysis Performance analysis

来源：评论

学校读者我要写书评

暂无评论

17 Divisible load scheduling in distributed system with buffer constraints: genetic algorithm and linear programming approach

引用

INTERNATIONAL JOURNAL OF parallel EMERGENT AND distributed SYSTEMS 2006年第5期21卷 303-321页

作者： Suresh, S. Mani, V. Omkar, S. N. Kim, H. J. Indian Inst Sci Bangalore Dept Aerosp Engn Bangalore Karnataka India Kangwon Natl Univ Dept Control & Instrumentat Engn Chunchon 200701 South Korea

Scheduling divisible loads in a single-level tree network/system with processors having finite buffer size is addressed. In earlier studies in divisible load scheduling the processors are assumed to have no buffer constraints or have infinite buffer capacity. Hence, the processing time and the load fractions assigned to the processors in the network are obtained by assuming that all the processors will stop computing at the same instant in time. Also in earlier studies, a closed-form expression for the processing time is derived, and using this closed-form expression, an optimal sequence of load distribution is obtained. When the processors in the network have finite buffer then this assumption that all the processors stop computing at the same time instant is not valid. So for a network with buffer constraints, there are two important problems: (i) for a given sequence of load distribution, how to obtain the processing time, and the load fractions assigned to the processors, and (ii) for a given network, how to obtain the optimal sequence of load distribution. Here problem (i) of obtaining the processing time and the load fractions assigned to the processors in the network, for a given sequence of load distribution, is not difficult to solve and is modelled as a linear programming problem and its solution is obtained. For a single-level tree network with m child processors there are m! sequences of load distribution. The optimal sequence of load distribution is the sequence of load distribution, for which the processing time of the entire processing load is a minimum. So, problem (ii) of obtaining the optimal sequence of load distribution is difficult. It is shown in an earlier study that this problem (ii) is NP-Hard. In this paper, genetic algorithm (GA) is used for problem (ii) to obtain the sequence of load distribution. Various issues related to genetic algorithms such as solution representation, selection methods and genetic operators are presented. Numerical

关键词： Divisible loads Scheduling problems Genetic algorithms Sequencing processing time

来源：评论

学校读者我要写书评

暂无评论

Divisible load scheduling in distributed system with buffer constraints: genetic algorithm and linear programming approach

引用

International Journal of parallel, Emergent & distributed Systems 2006年第5期21卷 303-321页

作者： Suresh, S. Mani, V. mani@acro.iisc.ernet.in Omkar, S. N. Kim, H. J. Department of Aerospace Engineering Indian Institute of Science Bangalore Bangalore India Department of Control and Instrumentation Engineering Kangwon National University Chunchon 200-701 South Korea

Scheduling divisible loads in a single-level tree network/system with processors having finite buffer size is addressed. In earlier studies in divisible load scheduling the processors are assumed to have no buffer constraints or have infinite buffer capacity. Hence, the processing time and the load fractions assigned to the processors in the network are obtained by assuming that all the processors will stop computing at the same instant in time. Also in earlier studies, a closed-form expression for the processing time is derived, and using this closed-form expression, an optimal sequence of load distribution is obtained. When the processors in the network have finite buffer then this assumption that all the processors stop computing at the same time instant is not valid. So for a network with buffer constraints, there are two important problems: (i) for a given sequence of load distribution, how to obtain the processing time, and the load fractions assigned to the processors, and (ii) for a given network, how to obtain the optimal sequence of load distribution. Here problem (i) of obtaining the processing time and the load fractions assigned to the processors in the network, for a given sequence of load distribution, is not difficult to solve and is modelled as a linear programming problem and its solution is obtained. For a single-level tree network with m child processors there are m ! sequences of load distribution. The optimal sequence of load distribution is the sequence of load distribution, for which the processing time of the entire processing load is a minimum. So, problem (ii) of obtaining the optimal sequence of load distribution is difficult. It is shown in an earlier study that this problem (ii) is NP-Hard. In this paper, genetic algorithm (GA) is used for problem (ii) to obtain the sequence of load distribution. Various issues related to genetic algorithms such as solution representation, selection methods and genetic operators are presented. Numerical

关键词： Divisible loads Divisible loads Scheduling problems Genetic algorithms Sequencing processing time Genetic algorithms processing time Scheduling problems Sequencing

来源：评论

学校读者我要写书评

暂无评论

A New Particle Model For Prediction Coding of Lossless Data Compression

A New Particle Model For Prediction Coding of Lossless Data ...

引用

International Multi-Symposiums on Computer and Computational Sciences (IMSCCS)

作者： Dianxun Shuai Qing Shuai Dept. of Computer Sci. and Eng. East China University of Sci. and Tech. Shanghai China

This paper presents a new generalized particle model (GPM) to generate the prediction coding for lossless data compression. Local rules for particle movement in GPM, parallel algorithm and its implementation structure to generate the desired predictive coding are discussed. The proposed GPM approach has advantages in terms of encoding speed, parallelism, scalability, simplicity, and easy hardware implementation over other sequential lossless compression methods

关键词： Predictive models Data compression image coding Predictive coding Wavelet transforms Encoding parallel processing Multimedia databases image reconstruction distributed computing

来源：评论

学校读者我要写书评

暂无评论

Acceleration of maximum likelihood estimation for tomosynthesis mammography

Acceleration of maximum likelihood estimation for tomosynthe...

引用

International Conference on parallel and distributed Systems (ICPADS)

作者： Juemin Zhang W. Meleis D. Kaeli Tao Wu Electrical and Computer Engineering Northeastern University Boston MA USA Radiology Department Massachusetts General Hospital Boston MA USA

Maximum likelihood (ML) estimation is used during tomosynthesis mammography reconstruction. A single reconstruction involves the processing of high-resolution projection images, which is both compute-intensive and time-consuming. This workload is presently a bottleneck in the accurate diagnosis of breast cancer during screening. This paper presents our parallelization work on an ML algorithm using three different partitioning models: no inter-communication, overlap with inter-communication and non-overlap model. These models are evaluated to obtain the best reconstruction performance given a range of computing environments with different computational power and network speed. Our test results show that the non-overlap method outperforms the other two methods on all five computing platforms evaluated. This parallelization of ML has enabled tomosynthesis to become a viable technology in the breast screening clinic, reducing reconstruction time from 3 hours on a PentiumIVworkstation to 6 minutes on a 32-node PentiumIV cluster

关键词： Acceleration Maximum likelihood estimation Mammography image reconstruction X-ray imaging Breast Cancer X-ray detectors Hospitals Maximum likelihood detection

来源：评论

学校读者我要写书评

暂无评论

Time-constrained loop scheduling with minimal resources

引用

Journal of Embedded Computing 2006年第1期2卷 103-117页

作者： O'Neil, Timothy W. Sha, Edwin H.-M. Department of Comp. Science University of Akron Akron OH 44325-4003 USA Department of Comp. Science Erik Jonsson School of Eng. & C.S. Box 830688 MS EC 31 Univ. of Texas at Dallas Richardson TX 75083-0688 USA. Tel.: +1 972 883 4193Fax: +1 972 883 2349[email protected]

Many applications commonly found in digital signal processing and image processing applications can be represented by data-flow graphs (DFGs). In our previous work, we proposed a new technique, extended retiming, which can be combined with minimal unfolding to transform a DFG into one which is rate-optimal. The result, however, is a DFG with split nodes, a concise representation for pipelined schedules. This model and the extraction of the pipelined schedule it represents have heretofore not been explored. In this paper, we develop new results regarding the construction of such graphs. We develop scheduling algorithms for such graphs, and then discuss a way to reduce the hardware requirements of such schedules. In the process, we state and prove a tight upper bound on the minimum number of processors required to execute the static schedule produced by our algorithms. We also construct an unfolding algorithm for split-node graphs and combine it with our scheduling methods to achieve rate-optimality in all cases. Finally, we demonstrate our methods on a specific example.

关键词： parallel and distributed systems compilers optimization modeling languages programmable signal processors

来源：评论

学校读者我要写书评

暂无评论

Optimal information fusion distributed smoother for discrete multichannel ARMA signals

引用

IEE PROCEEDINGS-VISION image AND SIGNAL processing 2005年第5期152卷 583-589页

作者： Sun, S Zhang, C Heilongjiang Univ Dept Automat Harbin 150080 Peoples R China Harbin Inst Technol Dept Math Harbin 150081 Peoples R China

Based on the multisensor optimal information fusion criterion weighted by matrices in the linear minimum variance sense, using estimators of white measurement noise, an optimal information fusion distributed Kalman smoother is given for discrete time multichannel autoregressive moving average (ARMA) signals with correlated noise. It has a three-layer fusion structure with a fault tolerant property. The first and the second fusion layers both have netted parallel structrues to determine cross-covariance matrices between any two faultless sensors. The third fusion layer is the fusion centre to determine the optimal weights and obtain the optimal fusion smoother. The fusion smoother has higher precision than that of any local smoother. Its effectiveness is shown by applying it to a double-channel signal system with three sensors.

来源：评论

学校读者我要写书评

暂无评论

Achieving fast fractal image compression using spiral architecture

Achieving fast fractal image compression using spiral archit...

引用

International Conference on parallel and distributed processing Techniques and Applications

作者： Liu, D He, XJ Dalian Maritime Univ Inst Naut Sci & Technol Dalian 116026 Liaoning Peoples R China

ISBN: (纸本)1932415610

Spiral Architecture is a relatively new and powerful approach to general-purpose machine vision system. n this novel architecture, Spiral Addition and Multiplication achieve image processing. As we all nown, fractal image compression methods have maximal image compression ratio, at the cost Of slow coding speed. This paper presents an algorithm to achieve high image compression ratio without slow coding speed on Spiral Architecture, which also improves the Spiral Architecture s usage in image processing.

关键词： image compression spiral architecture fractals distributed image processing

来源：评论

学校读者我要写书评

暂无评论

A review on fractal image compression coding and some improvement measures

A review on fractal image compression coding and some improv...

引用

2005 International Conference on parallel and distributed processing Techniques and Applications, PDPTA'05

作者： Shu-Guang, Ji Liu, Dan Zhangzhang Institute of Nautical Science Technology Dalian Maritime University Dalian Liaoning 116026 China

ISBN: (纸本)9781932415582

A review on the fractal image compression coding and the improvement measures are provided in this paper. The development process of the fractal image compression coding is introduced briefly. Some basic mathematic theories about the fractal image compression coding are given. The main problems which exist in the fractal compression coding bring into focus. Some traditional and new methods about the fractal image compression coding are discussed. The advantages and disadvantages of these methods are comprehensively analy ed. And the mixture of these methods is concerned. It is believed that the fractal image compression coding will be one of the most effective methods in the field of digital image coding.

关键词： Fractals

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：