发布求助
文献互助 智能选刊 最新文献

Proceedings. Third IEEE International Conference on Engineering of Complex Computer Systems (Cat. No.97TB100168)最新文献

筛选
英文 中文
Precedence constraints in hard real-time distributed systems 硬实时分布式系统中的优先约束
Proceedings. Third IEEE International Conference on Engineering of Complex Computer Systems (Cat. No.97TB100168) Pub Date : 1997-09-08 DOI: 10.1109/ICECCS.1997.622294
J. Orozco, R. Cayssials, Jorge Santos, E. Ferro
{"title":"Precedence constraints in hard real-time distributed systems","authors":"J. Orozco, R. Cayssials, Jorge Santos, E. Ferro","doi":"10.1109/ICECCS.1997.622294","DOIUrl":"https://doi.org/10.1109/ICECCS.1997.622294","url":null,"abstract":"Hard real-time multitask-multiprocessor systems are one of the more important species of the taxonomic genus of distributed systems. The assignment of m preemptible periodic tasks to be executed in a set of n processors (interconnected through a communications network) is a NP-complete problem that must meet several constraints: time, allocation, resources, communication and precedence. The first three are processor-dependent and the fourth is network-dependent, but all of them can be verified as the assignment process goes on. Precedence constraints, instead, can be best verified when a tentative assignment, meeting the first four constraints, is obtained. In this paper, a formally proved method is presented to validate tentative assignments. In order to solve the problem of jitter in data arrivals, timed release counters are proposed.","PeriodicalId":168372,"journal":{"name":"Proceedings. Third IEEE International Conference on Engineering of Complex Computer Systems (Cat. No.97TB100168)","volume":"82 1 Pt 1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-09-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123235608","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 8
Feasibility concerns in PGM graphs with bounded buffers 带有界缓冲区的PGM图的可行性问题
Proceedings. Third IEEE International Conference on Engineering of Complex Computer Systems (Cat. No.97TB100168) Pub Date : 1997-09-08 DOI: 10.1109/ICECCS.1997.622304
Sanjoy Baruah, S. Goddard, K. Jeffay
{"title":"Feasibility concerns in PGM graphs with bounded buffers","authors":"Sanjoy Baruah, S. Goddard, K. Jeffay","doi":"10.1109/ICECCS.1997.622304","DOIUrl":"https://doi.org/10.1109/ICECCS.1997.622304","url":null,"abstract":"The Processing Graph Method (PGM)-a dataflow model widely used in the design and analysis of embedded signal-processing applications-is studied from a real-time scheduling perspective. It is shown that the problem of deciding if instances of the general model are feasible on a single processor is intractable (co-NP-complete in the strong sense); however, a useful special case is sometimes more tractable. An efficient feasibility test and an optimal preemptive scheduling algorithm are derived for this special case, and a procedure is presented which permits system architects to make efficient use of computational resources and memory requirements for buffers while constructing real-time dataflow applications that offer hard service guarantees.","PeriodicalId":168372,"journal":{"name":"Proceedings. Third IEEE International Conference on Engineering of Complex Computer Systems (Cat. No.97TB100168)","volume":"135 11","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-09-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132802270","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 10
Problem complexity 问题的复杂性
Proceedings. Third IEEE International Conference on Engineering of Complex Computer Systems (Cat. No.97TB100168) Pub Date : 1997-09-08 DOI: 10.1109/ICECCS.1997.622318
Michael Jackson
{"title":"Problem complexity","authors":"Michael Jackson","doi":"10.1109/ICECCS.1997.622318","DOIUrl":"https://doi.org/10.1109/ICECCS.1997.622318","url":null,"abstract":"An approach to problem analysis is described, based on the notion of a problem frame. Problem frames are intended to capture classes of recognisable and soluble problems. Because problems are located in the environment, not in the machine to be built, problem frames are characterised by environment properties and structures. Useful frames are necessarily very narrow: realistic problems are regarded as parallel superimpositions of subproblems. Problem complexity arises from the interactions of these subproblems and of their solutions.","PeriodicalId":168372,"journal":{"name":"Proceedings. Third IEEE International Conference on Engineering of Complex Computer Systems (Cat. No.97TB100168)","volume":"52 9","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-09-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114040091","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 6
Cache based fault recovery for distributed systems 基于缓存的分布式系统故障恢复
Proceedings. Third IEEE International Conference on Engineering of Complex Computer Systems (Cat. No.97TB100168) Pub Date : 1997-09-08 DOI: 10.1109/ICECCS.1997.622303
A. Mendelson, N. Suri
{"title":"Cache based fault recovery for distributed systems","authors":"A. Mendelson, N. Suri","doi":"10.1109/ICECCS.1997.622303","DOIUrl":"https://doi.org/10.1109/ICECCS.1997.622303","url":null,"abstract":"No cache based techniques for roll-forward fault recovery exist at present. A split-cache approach is proposed that provides efficient support for checkpointing and roll-forward fault recovery in distributed systems. This approach obviates the use of discrete stable storage or explicit synchronization among the processors. Stability of the checkpoint intervals is used as a driver for real time operations.","PeriodicalId":168372,"journal":{"name":"Proceedings. Third IEEE International Conference on Engineering of Complex Computer Systems (Cat. No.97TB100168)","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-09-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132199127","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 2
The Butterfly Methodology: a gateway-free approach for migrating legacy information systems 蝴蝶方法论:用于迁移遗留信息系统的无网关方法
Proceedings. Third IEEE International Conference on Engineering of Complex Computer Systems (Cat. No.97TB100168) Pub Date : 1997-09-08 DOI: 10.1109/ICECCS.1997.622311
Bing Wu, D. Lawless, J. Bisbal, R. Richardson, J. Grimson, V. Wade, D. O'Sullivan
{"title":"The Butterfly Methodology: a gateway-free approach for migrating legacy information systems","authors":"Bing Wu, D. Lawless, J. Bisbal, R. Richardson, J. Grimson, V. Wade, D. O'Sullivan","doi":"10.1109/ICECCS.1997.622311","DOIUrl":"https://doi.org/10.1109/ICECCS.1997.622311","url":null,"abstract":"The problems posed by mission-critical legacy systems-e.g., brittleness, inflexibility, isolation, non-extensibility, lack of openness-are well known, but practical solutions have been slow to emerge. Generally, organisations attempt to keep their legacy systems operational, while developing mechanisms which allow the legacy systems to interoperate with new, modern systems which provide additional functionality. The most mature approach employs gateways to provide this interoperability. However, gateways introduce considerable complexity in their attempt to maintain consistency between the legacy and target systems. This paper presents an innovative gateway-free approach to migrating legacy information systems in a mission-critical environment: the Butterfly Methodology. The fundamental premise of this methodology is to question the need for the parallel operation of the legacy and target systems during migration.","PeriodicalId":168372,"journal":{"name":"Proceedings. Third IEEE International Conference on Engineering of Complex Computer Systems (Cat. No.97TB100168)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-09-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130114124","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 96
A synthesis method for fault-tolerant and flexible multipath routing protocols 一种容错灵活多径路由协议的综合方法
Proceedings. Third IEEE International Conference on Engineering of Complex Computer Systems (Cat. No.97TB100168) Pub Date : 1997-09-08 DOI: 10.1109/ICECCS.1997.622301
Yutaka Hatanaka, Masahide Nakamura, Y. Kakuda, T. Kikuno
{"title":"A synthesis method for fault-tolerant and flexible multipath routing protocols","authors":"Yutaka Hatanaka, Masahide Nakamura, Y. Kakuda, T. Kikuno","doi":"10.1109/ICECCS.1997.622301","DOIUrl":"https://doi.org/10.1109/ICECCS.1997.622301","url":null,"abstract":"Design of practical routing protocols is complex and difficult due to complicated requirements of fault tolerance and flexibility. The protocol is defined to be fault-tolerant if messages can be rerouted via another path when the communication channel fails. In this paper, we propose a new synthesis method for generating a fault-tolerant routing protocol for a given service specification and a network topology. The routing protocol thus obtained adopts a multipath routing augmented with sets, where each set stores the next nodes for routing, and updates the sets according to network topology changes. Additionally, the routing protocol can attain flexibility by the multipath routing mechanism in the sense that only a small amount of changes is needed for addition or deletion of nodes. Finally, we show the effectiveness of the proposed method through an application to a typical routing service of message delivery from a source node to a destination node.","PeriodicalId":168372,"journal":{"name":"Proceedings. Third IEEE International Conference on Engineering of Complex Computer Systems (Cat. No.97TB100168)","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-09-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126600720","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 10
A three layers software development method: foundations and definition 三层软件开发方法:基础和定义
Proceedings. Third IEEE International Conference on Engineering of Complex Computer Systems (Cat. No.97TB100168) Pub Date : 1997-09-08 DOI: 10.1109/ICECCS.1997.622307
S. Dakhli, Claudine Toffolon
{"title":"A three layers software development method: foundations and definition","authors":"S. Dakhli, Claudine Toffolon","doi":"10.1109/ICECCS.1997.622307","DOIUrl":"https://doi.org/10.1109/ICECCS.1997.622307","url":null,"abstract":"The role of information systems in modern organizations is constantly growing. They become today an essential component of their competitiveness. But, the software industry isn't mature and still in crisis. Certainly, all solutions proposed nowadays contribute in a large part to improve the software's development process productivity and products quality, but they are not sufficient, partly because they ignore some aspects of the software. In this paper, we propose a three layers software development method which takes into account aspects of software that are not always considered. This methodology is based on ten software dimensions and relies on three processes: organizational engineering, software engineering and architecture definition.","PeriodicalId":168372,"journal":{"name":"Proceedings. Third IEEE International Conference on Engineering of Complex Computer Systems (Cat. No.97TB100168)","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-09-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127087902","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 5
Optimal deadline assignment for scheduling soft aperiodic tasks in hard real-time environments 硬实时环境下软非周期任务调度的最优期限分配
Proceedings. Third IEEE International Conference on Engineering of Complex Computer Systems (Cat. No.97TB100168) Pub Date : 1997-09-08 DOI: 10.1109/ICECCS.1997.622295
G. Buttazzo, F. Sensini
{"title":"Optimal deadline assignment for scheduling soft aperiodic tasks in hard real-time environments","authors":"G. Buttazzo, F. Sensini","doi":"10.1109/ICECCS.1997.622295","DOIUrl":"https://doi.org/10.1109/ICECCS.1997.622295","url":null,"abstract":"In this paper we present a new scheduling approach for servicing soft aperiodic requests in a hard real-time environment, where a set of hard periodic tasks is scheduled using the Earliest Deadline First algorithm. The main characteristic of the proposed algorithm is that it achieves full processor utilization and optimal aperiodic responsiveness, still guaranteeing the execution of the periodic tasks. Another interesting feature of the algorithm is that it can easily be tuned to change its performance and complexity according to the application requirements. Schedulability issues, performance results, and implementation complexity of the algorithm are discussed and compared with other classical methods, such as Background, the Total Bandwidth Sewer (TBS), and the optimal EDL server. Extensive simulations show that a substantial improvement can be achieved with a little increase of complexity, ranging from the TBS performance up to the optimal behavior.","PeriodicalId":168372,"journal":{"name":"Proceedings. Third IEEE International Conference on Engineering of Complex Computer Systems (Cat. No.97TB100168)","volume":"147 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-09-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130709435","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 100
Evolution: a more practical approach than refinement for software development 演进:对于软件开发来说，是一种比精化更实用的方法
Proceedings. Third IEEE International Conference on Engineering of Complex Computer Systems (Cat. No.97TB100168) Pub Date : 1997-09-08 DOI: 10.1109/ICECCS.1997.622305
Shaoying Liu
{"title":"Evolution: a more practical approach than refinement for software development","authors":"Shaoying Liu","doi":"10.1109/ICECCS.1997.622305","DOIUrl":"https://doi.org/10.1109/ICECCS.1997.622305","url":null,"abstract":"Refinement of operations is well defined in terms of refinement rules and is considered as a reasonable discipline for software development. This paper, however, observes that refinement is not sufficient to serve this role for the entire software development process and then proposes evolution for substitution. We show that refinement is indeed a special case of evolution and evolution is transitive. A small case study is given to demonstrate that using evolution rather than refinement as the discipline for software development is a more practical approach. The idea presented in this paper may be controversial, but the author believes that this idea is more useful, practical, and instructive than refinement approach, and expects to inspire more discussions about this issue.","PeriodicalId":168372,"journal":{"name":"Proceedings. Third IEEE International Conference on Engineering of Complex Computer Systems (Cat. No.97TB100168)","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-09-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125037666","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 16
Optimal mobile location tracking by multilayered model strategy 基于多层模型策略的最优移动位置跟踪
Proceedings. Third IEEE International Conference on Engineering of Complex Computer Systems (Cat. No.97TB100168) Pub Date : 1997-09-08 DOI: 10.1109/ICECCS.1997.622300
Junping Sun, Hee C. Lee
{"title":"Optimal mobile location tracking by multilayered model strategy","authors":"Junping Sun, Hee C. Lee","doi":"10.1109/ICECCS.1997.622300","DOIUrl":"https://doi.org/10.1109/ICECCS.1997.622300","url":null,"abstract":"We developed a multilayered model for the purposes such as mobility management, mobile activity modeling, and optimal paging and mobile location tracking. A bottleneck in the forward control channel (FOCC) is caused due to constraints such as the limited bandwidth and number of radio frequency channels, and inefficiency of conventional mobile paging methods in mobile telecommunication systems. In order to minimize the paging cost and to maximize utilization of the bandwidth in the FOCC, we develop a new paging schema, based on the multilayered model, with the optimal partition of paging zones. By using the refined mobile's probability pattern stored in a statistical profile, we employ the genetic algorithm and the probabilistic cost function to generate the optimal partition of paging zones such that the paging cost to locate a mobile station as well as the bandwidth consumption in the FOCC is minimized.","PeriodicalId":168372,"journal":{"name":"Proceedings. Third IEEE International Conference on Engineering of Complex Computer Systems (Cat. No.97TB100168)","volume":"140 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-09-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134642690","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 13
首页 上一页 下一页 尾页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：604180095
Book学术官方微信