Proceeding of 13th IEEE Annual International Phoenix Conference on Computers and Communications最新文献

{"title":"Design-Space Exploration for High-Level Synthesis","authors":"I. Ahmad, M. Dhodhi, F. Hielscher","doi":"10.1109/PCCC.1994.504159","DOIUrl":"https://doi.org/10.1109/PCCC.1994.504159","url":null,"abstract":"The design methodology presented in this paper simultaneously performs scheduling, allocation and module selection using problem-space genetic algorithm (PSGA) to optimize the three items: (1) the hardware resources (i.e., functional units, registers, and interconnection cost), (2) the number of control steps and (3) the length of the clock period. The proposed PSGA based approach uses the inherent parallelism provided by genetic algorithms and exploits the problem-specific knowledge by using a simple and fast heuristic to search a large design space effectively and efficiently. The proposed PSGA method offers several advantages such as the versatility, simplicity, objective independence and the computational advantages for problems of large size over other existing techniques. Experiments on benchmarks show very promising results.","PeriodicalId":203232,"journal":{"name":"Proceeding of 13th IEEE Annual International Phoenix Conference on Computers and Communications","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-04-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125121519","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}

{"title":"Quality of Service Management for Distributed Multimedia Applications","authors":"A. Seneviratne, M. Fry, V. Withana, E. Horlait, V. Saparamadu, A. Richards","doi":"10.1109/PCCC.1994.504150","DOIUrl":"https://doi.org/10.1109/PCCC.1994.504150","url":null,"abstract":"Future distribut,ed systems will he recliiiretl t o sii1)port multimedia applications wit,li widely varying service requirements. Sucli a.pplira.t,ioiis in(-liitle inkractive multimedia informa.t,ion services, siic-11 i1.s electronic journals, and t,ools t.o snpport, rp;d t h e i n t w m tions between people, such a.s niult,ipoint, vicleo c-oiiferencing and groupware. The pIat,fbnii for these ap~)l i cations will typically be a high powered workst.n.t.ioii with audio and video capabilit,ies. Tlie int,enwiiiig network will be a heterogeneous int,ernvt,rork of 1)iiI)lic and private networks. These applications will express t,lieir iieetls t,liroilgli Quality of Service (QoS) requirellielit,s ;i,t t,lir al)l)lication level, using semantics apI)ropria.t,e t,o t.lie a1)plication. For example, an applic:at.ion iri;i.y rrriiiclst, E. Horlait Laboratoy MASI, University of Pierre Marie Curie Paris, France","PeriodicalId":203232,"journal":{"name":"Proceeding of 13th IEEE Annual International Phoenix Conference on Computers and Communications","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-04-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114540758","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}

{"title":"The Time-Space Model for Instruction Reference Behavior","authors":"C. Weng, E. Johnson","doi":"10.1109/PCCC.1994.504118","DOIUrl":"https://doi.org/10.1109/PCCC.1994.504118","url":null,"abstract":"In this paper, an abstract model is established for describing the behavior of instruction references. From this model, we can obtain accurate predictions of cache miss ratios without the expense of trace-driven simulation. The time-space model explores the relationship between the sojourn times and working spaces of program executions. The average sojourn time per reference (ASPR) of each block of program activity is used as an indicator of the likelihood that such blocks stay in a cache. A time-space list is created, ordered by ASPR, to keep track of how much time is spent in each block of the working space. This list incorporates the information as to phase separations, loop sizes, loop counts, and so on. With this time-space relation of a trace and a few constants regarding the cache memory configuration, the miss ratio curve of a program can be predicted, based on the assumption that the higher ASPR blocks always stay in the cache. We present an evaluation of this technique using a wide variety of programs. The miss ratio curves predicted by the timespace model for fully associative caches are compared with the curves produced by trace-driven simulation, with very good agreement in most cases.","PeriodicalId":203232,"journal":{"name":"Proceeding of 13th IEEE Annual International Phoenix Conference on Computers and Communications","volume":"6 2","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-04-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"113957547","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}

{"title":"Design of the GRAMS Object-Oriented Graphics System","authors":"P. Egbert","doi":"10.1109/PCCC.1994.504122","DOIUrl":"https://doi.org/10.1109/PCCC.1994.504122","url":null,"abstract":"The field of computer graphics has expanded its influence to practically every other field. Advances in this field have simplified and enhanced areas as diverse as medicine, art, music, architecture, manufacturing, and business. Although great strides have been made in the image generation process, little progress has been made in making graphics systems easy to use. Typical graphics systems today still force the user to interact with the system at a level of abstraction convenient to the machine, rather than a level conveient to the user. By capitalizing on the benefits of the object-oriented paradigm, many of the problems in traditional graphics systems can be overcome. This paper presents GRAMS, the Graphical Application Modeling Support System. GRAMS is an object oriented 3D graphics system designed specifically with the goals of raising the abstraction level at which the user interacts with the system, providing a simple mechanism for extensibility at all system levels, and providing an environment conducive for experimentation with powerful graphics techniques. This provides a system which is easy to use by abstracting the low level details of complex graphics algorithms away from the user. This allows the user to exploit these capabilities without being required to understand their underlying details.","PeriodicalId":203232,"journal":{"name":"Proceeding of 13th IEEE Annual International Phoenix Conference on Computers and Communications","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-04-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128274325","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}

{"title":"On the routing problem in faulty IEH graphs","authors":"S. Sur, P. Srimani","doi":"10.1109/PCCC.1994.504098","DOIUrl":"https://doi.org/10.1109/PCCC.1994.504098","url":null,"abstract":"The IEH graphs, a generalization of the hypercube, was introduced by Sur and Srimani [SI. It was shown that IEH graphs are incrementally extensible in steps of 1, optimally fault tolerant and its diameter is logarithmic in the number of nodes. Moreover, for any given number of nodes, the difference of the maximum and the minimum degree of a node in the graph is 5 1, i.e., the graph is almost regular. This paper analyzes IEH graphs in presence of failures. We develop a routing algorithm in IEH graphs in presence of faults and compute the fault diameter. The routing algorithm incorporates an interesting algorithm to route to n destination nodes from a given source node in a complete hypercube H,.","PeriodicalId":203232,"journal":{"name":"Proceeding of 13th IEEE Annual International Phoenix Conference on Computers and Communications","volume":"192 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-04-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125850911","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}

{"title":"Modeling of Buffered Multiple Bus Multiprocessor Systems in a Non-Uniform Traffic Environment","authors":"Mohammed Atiquzzaman, M. Sayeed","doi":"10.1109/PCCC.1994.504119","DOIUrl":"https://doi.org/10.1109/PCCC.1994.504119","url":null,"abstract":"Performance modeling of multiple-bus systems is usually carried out under the assumption of uniform memory reference model. Hot spots arising in multiprocessor systems give rise to non-uniform memory references. I t is known that a hot spot memory reference pattern results i n a significant degradation in the performance of Q buffered multistage interconnection network. The aim of this research is t o study the effect of hot spots on the performance of buffered multiple-bus systems. Analytical models based on Markov chains have been developed to determine the bandwidth of buffered multiple-bus systems in a hot spot memory reference pattern. The models assume that unsuccessful memory requests are queued an the buffers at the memory modules. Furthermore, processors with outstanding requests are not allowed to generate new requests. The model allows a fast and inexpensive method of performance evaluation of a multiple bus system in the case of a hot spot memory reference pattern.","PeriodicalId":203232,"journal":{"name":"Proceeding of 13th IEEE Annual International Phoenix Conference on Computers and Communications","volume":"536 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-04-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133463842","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}

{"title":"Fault tolerant ATM backbone network design considering cell loss rates and end-to-end delay constraints","authors":"Ki-Sang Song, Arun Kumar Somani","doi":"10.1109/PCCC.1994.504102","DOIUrl":"https://doi.org/10.1109/PCCC.1994.504102","url":null,"abstract":"Unlike conventional packet switched networks, the ATM network is expected to perform connection-oriented operations for calls with variable traffic characteristics for each call. Fault tolerance in high speed ATM networks is greatly needed even for short-time link failures due to the large cell loss possibility. Here, we develop an ATM backbone network design algorithm by considering different Grades of Service (GOS) such as cell loss probabiliiy and mean end-to-end delay requirement for each call request. In addition, we ensure that these performance requirements are met even under faulty network conditions. Numerical examples show that our algorithm yields good solutions.","PeriodicalId":203232,"journal":{"name":"Proceeding of 13th IEEE Annual International Phoenix Conference on Computers and Communications","volume":"70 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-04-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117096443","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}

{"title":"Expected Performance Analysis of A Generic Parallel Search Technique","authors":"Wei-Ming Lin, Bo Yang","doi":"10.1109/PCCC.1994.504131","DOIUrl":"https://doi.org/10.1109/PCCC.1994.504131","url":null,"abstract":"","PeriodicalId":203232,"journal":{"name":"Proceeding of 13th IEEE Annual International Phoenix Conference on Computers and Communications","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-04-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114452641","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}

{"title":"Partial recoverability with distributed transactions","authors":"M. Nygård","doi":"10.1109/PCCC.1994.504095","DOIUrl":"https://doi.org/10.1109/PCCC.1994.504095","url":null,"abstract":"This paper concerns distributed databases and transactions with a distinction between global and local correctness criteria. The global requirements per system are weaker than the local requirements per site. The paper investigates an application which suits such a two-level division. The main motivation for our investigation is based on the fact that the commonly used correctness criteria for concurrency control and recovery, serializability and total recoverability, are very strict criteria. The use of more relaxed criteria (allowing more true parallel behaviour and more true partial behaviour) is therefore very appealing as long as this can be achieved without compromising safety or applicability. The main paradigm in our approach is based on the observation that relatively little knowledge about the databases and transactions can lead to major gains in system throughput. This allows specific systems to have more tailor-made correctness criteria. mygA93al introduced and analysed a 2-level model for non-serializability with distributed databases and transactions, while [Nyg893b] and [NygA93c] presented and discussed a system which suited such a 2-level division. Here the primary goal is to analyse and discuss n-level partial recoverability with distributed databases and transactions. The secondary goal is to integrate this with the 2-level model/system introduced in the above mentioned papers. Hence we both present a model and apply it to a particular system. We analyse the span between total recoverability per site and total recoverability per system. This requires local total recoverability but allows global partial recoverability. We discuss both single-level and multi-level recovery criteria. We relate and compare the resulting concepts to other established and proposed criteria. Our notions are entirely new. We consider step-wise committing transactions. Our main point is not thatpartial commitment is being used but rather to discuss how it should be controlled. The main result is a set of recovery rules which may be combined in an orthogonal way. The concepts and notions seem especially appropriate for systems/models which make use of added priority ruling.","PeriodicalId":203232,"journal":{"name":"Proceeding of 13th IEEE Annual International Phoenix Conference on Computers and Communications","volume":"2021 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-04-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132365419","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}

{"title":"Adaptive clustering of scientific data","authors":"A. Johnson, F. Fotouhi, N. Goel","doi":"10.1109/PCCC.1994.504121","DOIUrl":"https://doi.org/10.1109/PCCC.1994.504121","url":null,"abstract":"Scientific databases contain large amounts of interrelated information. This information is often stored in relational databases with hundreds of tables and thousands of rows per table. Clustering is an effective way to reduce the information-overhead associated with finding information among these tables, allowing the user to browse through the clusters as well as the individual tables. In this paper, we compare the use of two adaptive algorithms (genetic algorithms, and neural networks) in clustering the tables of a scientific database. These clusters allow the user to index into this overwhelming number of tables and find the needed information quickly. We cluster the tables based on the user’s queries and not on the content of the tables, thus the clustering reflects the unique relationships each user sees among the tables. The original database remains untouched, however each user will now have a personalized index into this database.","PeriodicalId":203232,"journal":{"name":"Proceeding of 13th IEEE Annual International Phoenix Conference on Computers and Communications","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-04-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132770716","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}