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

Modelling code mobility and migration: An OPM/Web approach

International Journal of Web engineering and Technology 2005年第1期2卷 6-28页

作者： Reinhartz-Berger, Iris Dori, Dov Katz, Shmuel Technion Israel Institute of Technology Technion City Haifa 32000 Israel Department of Management Information Systems University of Haifa Israel Information Systems Engineering Area Faculty of Industrial Engineering and Management Technion Israel Institute of Technology Israel MIT Cambridge United States Computer Science Department Technion Israel Institute of Technology Israel Systems and Software Development Laboratory Israel

Web applications exhibit dynamic behaviour through such features as animation, rapidly changing presentations, and interactive forms. The growing complexity of web applications requires a rigorous modelling approach capable of clearly and explicitly addressing code mobility issues. While mobile agent systems and programming languages support the implementation of code mobility with features such as applets or mobile agents, existing system analysis and design methods lack the facilities to model code mobility satisfactorily. OPM/Web is an extension of object-process methodology (OPM) for modelling distributed systems and web applications that enables intuitive modelling of code mobility concepts in a single framework. We propose generic OPM/Web models for common code mobility design paradigms, including Remote Evaluation, Code-on-Demand, PUSH and Mobile Agents. An OPM/Web model of a mobile application that handles requests for Quality of Service over the internet exemplifies the use and advantages of modelling such systems in OPM/Web. Copyright © 2005 Inderscience Enterprises Ltd.

关键词： World Wide Web

来源：评论

学校读者我要写书评

暂无评论

Lessons learned from automated analysis of industrial UML class models (an experience report) 05

引用

8th International Conference on Model Driven engineering Languages and systems, MoDELS 2005

作者： Cheng, Betty H. C. Stephenson, Ryan Berenbach, Brian Software Engineering and Network Systems Laboratory Department of Computer Science and Engineering Michigan State University East Lansing MI 48824 United States Siemens Corporate Research Inc.

ISBN: (纸本)3540290109

Automated analysis of object-oriented design models can provide insight into the quality of a given software design. Data obtained from automated analysis, however, is often too complex to be easily understood by a designer. This paper examines the use of an automated analysis tool on industrial software UML class models, where one set of models was created as part of the design process and the other was obtained from reverse engineering code. The analysis was performed by DesignAdvisor, a tool developed by Siemens Corporate Research, that supports metrics-based analysis and detection of design guideline violations. The paper describes the lessons learned from using the automated analysis techniques to assess the quality of these models. We also assess the impact of design pattern use in the overall quality of the models. Based on our lessons learned, identify design guidelines that would minimize the occurrence of these errors. © Springer-Verlag Berlin Heidelberg 2005.

关键词： computer aided design

来源：评论

学校读者我要写书评

暂无评论

Service Level Agreement based Allocation of Cluster Resources: Handling Penalty to Enhance Utility

Service Level Agreement based Allocation of Cluster Resource...

引用

IEEE International Conference on Cluster Computing

作者： Chee Shin Yeo Rajkumar Buyya Grid Computing and Distributed Systems Laboratory Department of Computer Science and Software Engineering University of Melbourne VIC Australia

Jobs submitted into a cluster have varying requirements depending on user-specific needs and expectations. Therefore, in utility-driven cluster computing, cluster resource management systems (RMSs) need to be aware of these requirements in order to allocate resources effectively. Service level agreements (SLAs) can be used to differentiate different value of jobs as they define service conditions that the cluster RMS agrees to provide for each different job. The SLA acts as a contract between a user and the cluster whereby the user is entitled to compensation whenever the cluster RMS fails to deliver the required service. In this paper, we present a proportional share allocation technique called LibraSLA that takes into account the utility of accepting new jobs into the cluster based on their SLA. We study how LibraSLA performs with respect to several SLA requirements that include: (i) deadline type whether the job can be delayed, (ii) deadline when the job needs to be finished, (iii) budget to be spent for finishing the job, and (iv) penalty rate for compensating the user for failure to meet the deadline

关键词： Resource management Grid computing Quality of service Delay Finishing Admission control Laboratories computer science software engineering Contracts

来源：评论

学校读者我要写书评

暂无评论

Critical-path and priority based algorithms for scheduling workflows with parameter sweep tasks on global grids

Critical-path and priority based algorithms for scheduling w...

引用

International Symposium on computer Architecture and High Performance Computing (SBAC-PAD)

作者： Tianchi Ma R. Buyya Grid Computing and Distributed Systems (GRIDS) Laboratory Department of Computer Science and Software Engineering University of Melbourne Australia

Parameter-sweep has been widely adopted in large numbers of scientific applications. Parameter-sweep features need to be incorporated into grid workflows so as to increase the scale and scope of such applications. New scheduling mechanisms and algorithms are required to provide optimized policy for resource allocation and task arrangement in such a case. This paper addresses scheduling sequential parameter-sweep tasks in a fine-grained manner. The optimization is produced by pipelining the subtasks and dispatching each of them onto well-selected resources. Two types of scheduling algorithms are discussed and customized to adapt the characteristics of parameter-sweep, as well as their effectiveness has been compared under multifarious scenarios.

关键词： Scheduling algorithm Application software Sensor arrays Grid computing Filtering Data visualization Processor scheduling Resource management Laboratories computer science

来源：评论

学校读者我要写书评

暂无评论

Cost-based scheduling for data-intensive applications on global grids 05

Cost-based scheduling for data-intensive applications on glo...

引用

International Symposium on High Performance Distributed Computing

作者： S. Venugopal R. Buyya Grid Computing and Distributed Systems (GRIDS) Laboratory Department of Computer Science and Software Engineering University of Melbourne Australia

We present an algorithm for scheduling distributed data intensive bag-of-task applications on data grids that have costs associated with requesting, transferring and processing datasets. We evaluate the algorithm on a... 详细信息

ISBN: (纸本)9780780390379

关键词： Processor scheduling Costs Grid computing Application software Physics computer networks Laboratories computer science software engineering Testing

来源：评论

学校读者我要写书评

暂无评论

Facilitating the construction of specification pattern-based properties

Facilitating the construction of specification pattern-based...

引用

IEEE International Conference on Requirements engineering

作者： S. Konrad B.H.C. Cheng Software Engineering and Network Systems Laboratory Department of Computer Science and Engineering Michigan State University East Lansing MI USA

Formal specification languages are often perceived as difficult to use by practitioners, and are therefore rarely-used in industrial software development practices. Numerous researchers have developed specification pattern systems to facilitate the construction of formal specifications of system properties. Feedback indicates that these patterns are considered helpful, but many practitioners prefer capturing properties using informal notations, such as natural language, instead of formal specification languages. This paper describes a project that addresses this technology gap. First, we introduce a stepwise process for deriving and instantiating system properties in terms of their natural language representations. The key components of this process are structured natural language grammars and specification pattern systems. Second, we describe SPIDER, a prototype implementation of a tool suite supporting this specification process. We illustrate the use of our approach with a description of a stepwise construction process of property specifications of a real-world automotive embedded system using Spider.

关键词： Natural languages Formal specifications Logic Construction industry Feedback Automotive engineering Industrial training Pattern analysis software engineering Laboratories

来源：评论

学校读者我要写书评

暂无评论

MNP: Multihop Network Reprogramming Service for Sensor Networks

MNP: Multihop Network Reprogramming Service for Sensor Netwo...

引用

International Conference on Distributed Computing systems

作者： S.S. Kulkarni Limin Wang Software Engineering and Network Systems Laboratory Department of Computer Science and Engineering Michigan State University East Lansing MI USA

Reprogramming of sensor networks is an important and challenging problem as it is often necessary to reprogram the sensors in place. In this paper, we propose a multihop reprogramming service designed for Mica-2/XSM motes. One of the problems in reprogramming is the issue of message collision. To reduce the problem of collision and hidden terminal problem, we propose a sender selection algorithm that attempts to guarantee that in a neighborhood there is at most one source transmitting the program at a time. Further, our sender selection is greedy in that it tries to select the sender that is expected to have the most impact. We also use pipelining to enable fast data propagation. MNP is energy efficient because it reduces the active radio time of a sensor node by putting the node into "sleep" state when its neighbors are transmitting a segment that is not of interest. Finally, we argue that it is possible to tune our service according to the remaining battery level of a sensor, i.e., it can be tuned so that the probability that a sensor is given the responsibility of transmitting the code is proportional to its remaining battery life

关键词： Spread spectrum communication Wireless sensor networks Bandwidth Sensor systems Energy efficiency Batteries software engineering Laboratories computer science Pipeline processing

来源：评论

学校读者我要写书评

暂无评论

A time optimization algorithm for scheduling bag-of-task applications in auction-based proportional share systems

A time optimization algorithm for scheduling bag-of-task app...

引用

International Symposium on computer Architecture and High Performance Computing (SBAC-PAD)

作者： A. Sulistio R. Buyya Grid Computing and Distributed Systems (GRIDS) Laboratory Department of Computer Science and Software Engineering University of Melbourne Carlton VIC Australia

Grid and peer-to-peer (P2P) network technologies enable aggregation of distributed resources for solving large-scale and computationally-intensive applications. These technologies are well-suited for bag-of-tasks (BoT) applications, because each application consists of many parallel and independent tasks. With multiple users competing for the same resources, the key challenge is to finish a user application within a specified deadline. In this paper, we propose a time optimization algorithm that schedules a user application on auction-based resource allocation systems. These allocation systems, which are based on proportional share, allow users to bid higher in order to gain more resource shares. Therefore, this algorithm adjusts a user bid periodically on these systems in order to finish the application on time.

关键词： Scheduling algorithm Application software Resource management Peer to peer computing Processor scheduling Grid computing computer applications Large-scale systems computer networks Distributed computing

来源：评论

学校读者我要写书评

暂无评论

Cost-based scheduling of scientific workflow applications on utility grids

Cost-based scheduling of scientific workflow applications on...

引用

IEEE International Conference on e-science and Grid Computing

作者： Jia Yu R. Buyya Chen Khong Tham Grid Computing and Distributed Systems Laboratory Department of Computer Science and Software Engineering University of Melbourne VIC Australia Department of Electrical and Computer Engineering National University of Singapore Singapore

Over the last few years, grid technologies have progressed towards a service-oriented paradigm that enables a new way of service provisioning based on utility computing models. Users consume these services based on their QoS (quality of service) requirements. In such "pay-per-use" grids, workflow execution cost must be considered during scheduling based on users' QoS constraints. In this paper, we propose a cost-based workflow scheduling algorithm that minimizes execution cost while meeting the deadline for delivering results. It can also adapt to the delays of service executions by rescheduling unexecuted tasks. We also attempt to optimally solve the task scheduling problem in branches with several sequential tasks by modeling the branch as a Markov decision process and using the value iteration method

关键词： Optimal scheduling Processor scheduling Scheduling algorithm Workflow management software Grid computing Quality of service Costs computer networks Time factors Delay

来源：评论

学校读者我要写书评

暂无评论

Investigating manifold learning algorithms based on magnification factors and principal spread directions

引用

Jisuanji Xuebao/Chinese Journal of computers 2005年第12期28卷 2000-2009页

作者： He, Li Zhang, Jun-Ping Zhou, Zhi-Hua Shanghai Key Laboratory of Intelligent Information Processing Department of Computer Science and Engineering Fudan University Shanghai 200433 China Key Laboratory of Complex Systems and Intelligence Science Chinese Academy of Sciences Shanghai 200433 China Department of Computer Science and Engineering School of Mathematical Sciences Fudan University Shanghai 200433 China National Laboratory for Novel Software Technology Nanjing University Nanjing 210093 China

As a new unsupervised learning technique, manifold learning has captured the attention of many researchers in the field of machine learning and cognitive sciences. The major algorithms include Isometric mapping (ISOMAP) and Locally Linear Embedding (LLE). The approaches can be used for discovering the intrinsic dimensions of nonlinear high-dimensional data effectively and aim researchers to analyze the data better. How to quantitatively analyze the relationship between the intrinsic dimensions and the observation space, however, has fewer reports. And thus further works in manifold learning may have suffered some difficulties. The paper focuses on two kinds of manifold learning algorithms (ISOMAP, LLE), and discusses magnification factors and principal spread directions from the observation space to the intrinsic low-dimensional space. Also the corresponding algorithm is proposed. Experiments show the effectiveness and advantages of the research.

关键词： Learning algorithms

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：