{"title":"Memory-based multiprocessor translation-lookaside buffers: multiple paging arenas vs. large size TLB","authors":"P. Teller, Qidong Xu","doi":"10.1109/PCCC.1994.504092","DOIUrl":"https://doi.org/10.1109/PCCC.1994.504092","url":null,"abstract":"Translation-Lookaside B g e r s (TLBs) are virtual-address caches that are used to effrciently implement virtual memory. Teller, Kenner, and Snir 1161 proposed locating TLBs at memory. Using trace-driven simulations, Teller and Gottlieb 1151 compared the performance of memory-based TLBs with that of conventional processor-based TLBs. Their results indicate that memory-based TLBs can outperform processor-based TLBs in uniprogrammed multiprocessors, provided that memory is partitioned into equal-size clusters to which virtual-to-physical page mappings are fured (called paging arenas) and the number of paging arenas (M) increases with the number of processors (N). We extend Teller and Gottlieb's study by simulating multiprogrammed memory-based TLB systems with M = 2\"', m=O, ..., 3 and larger-size TLBs. Our results agree with those of [I51 and indicate that for memory-based TLB systems, as M increases with N , performance improves, while the percentage of improvement &creases. We also show that comparable performance improvements can be attained by systems with one paging arena and larger memory-based TLBs. Unlike processor-based TLBs, the size of memory-based TLBs is not limited by processor chip size.","PeriodicalId":203232,"journal":{"name":"Proceeding of 13th IEEE Annual International Phoenix Conference on Computers and Communications","volume":"15 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":"131873104","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":"A functional model for test sequence generation","authors":"Liang-Seng Koh, Chang-Jia Wang, M. Liu","doi":"10.1109/PCCC.1994.504135","DOIUrl":"https://doi.org/10.1109/PCCC.1994.504135","url":null,"abstract":"In this paper, a functional model is developed to explore the various requirements of a protocol. By modeling these requirements as functions, one can introduce a notion of functional correctness to describe the conformity of an implementation to a protocol specification. A metric to measure the effectiveness of a test suite for exploiting an implementation is also proposed. Based on this model, an algorithm is developed to generate test suites. The basic technique of the algorithm is axiomatic.","PeriodicalId":203232,"journal":{"name":"Proceeding of 13th IEEE Annual International Phoenix Conference on Computers and Communications","volume":"129 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":"132435610","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":"Augmented ShuffleNet Multihop Lightwave Networks","authors":"Lin Wang, Kwok-Wah Hung","doi":"10.1109/PCCC.1994.504155","DOIUrl":"https://doi.org/10.1109/PCCC.1994.504155","url":null,"abstract":"In ShuffleNet Multihop Lightwave Networks with hot-potato routing, when more than two packets simultaneously arrive at a given node and contend for the same outgoing link to achieve minimum distance routing, then all but one, based on their priorities, will be misrouted to links which produce longer paths to the destination. In this paper, we propose a new topology for multihop lightwave networks, called Augmented ShufileNet, to shorten the alternate path traveled by misrouted packets. The Augmented ShuffleNet is constructed with slightly change in the ShuffleNet connectivity while retaining the simple addressing and self-routing properties. We also derive the principle of connectivity of this new topology and design a construction algorithm for the Augmented ShuffleNet. Compared with the ShuffleNet, the performance is greatly improved by reducing the expected number of hops using this new","PeriodicalId":203232,"journal":{"name":"Proceeding of 13th IEEE Annual International Phoenix Conference on Computers and Communications","volume":"82 ","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-04-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114097949","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}
Mingkuan Liu, A. Pathan, M. Scottis, Gong-San Yu, S. Chowdhury, S. Loh
{"title":"A video communications testbed for transmission over paeket switching networks","authors":"Mingkuan Liu, A. Pathan, M. Scottis, Gong-San Yu, S. Chowdhury, S. Loh","doi":"10.1109/PCCC.1994.504156","DOIUrl":"https://doi.org/10.1109/PCCC.1994.504156","url":null,"abstract":"Over the last decade, video coding and networking technology have both advanced significantly. We now have standardized low bit rate video compression codes such as CCITT H.261, and also have low cost network access such as Ethernet, frame-relay, and switched megabit data service (SMDS). To facilitate research for cost-effective video communications over packet switching networks, this paper describes a real time testbed and illustrates some results. In packet switching, video packets can be lost or have random. delay. If a compression code is sensitive to packet loss or random delay, the end-to-end video transmission quality can be unacceptable even at a moderate network utilization. We will demonstrate some real time transmission results over Ethernet. To help developing a good compression code, we need to identify the performance dependence of video transmission on various network transport conditions. To achieve this, a network emulator is used in the testbed. The network emulator can support high speed transmission and can be programmed for different network conditions such as random delay. With the help of the emulator, we can evaluate video quality in real time and develop compression codes for transmission in different networks.","PeriodicalId":203232,"journal":{"name":"Proceeding of 13th IEEE Annual International Phoenix Conference on Computers and Communications","volume":"13 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":"123971936","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":"Next Generation Project Management Systems, Part 2: Prototyping","authors":"L. E. Heindel, V. Kasten, K. J. Schlieber","doi":"10.1109/PCCC.1994.504112","DOIUrl":"https://doi.org/10.1109/PCCC.1994.504112","url":null,"abstract":"","PeriodicalId":203232,"journal":{"name":"Proceeding of 13th IEEE Annual International Phoenix Conference on Computers and Communications","volume":"151 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":"116157558","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":"Visualizing Directed Graphs Using a Position Assignment Approach Based on Hopfield Neural Networks","authors":"Kusnadi, J. Carothers, G. Anderson, J. Bigelow","doi":"10.1109/PCCC.1994.504161","DOIUrl":"https://doi.org/10.1109/PCCC.1994.504161","url":null,"abstract":"One of the challenges in computer design automation is to visualize scheduling and allocation graphs. This visualization incorporates some approaches of drawing aesthetics which involve combinatorial optimization. In this paper, a method of vertex position assignment using a Hopfield-type neural network is explored to optimize directed graph visualizations. This method allows crossing number and path length minimization to be processed simultaneously. The neural network designed and implemented for this purpose has shown promising results. In addition, this method is directly applicable to any problem that requires visualization of a multi-level, directed graph. Performance results for moderate-sized directed graphs are presented. Figure 1: Same digraph, different maps and readability.","PeriodicalId":203232,"journal":{"name":"Proceeding of 13th IEEE Annual International Phoenix Conference on Computers and Communications","volume":"79 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":"126344320","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":"A Novel Approach to Developing Object-Oriented Network Management Applications","authors":"A. Prasad","doi":"10.1109/PCCC.1994.504144","DOIUrl":"https://doi.org/10.1109/PCCC.1994.504144","url":null,"abstract":"Network management software development is complex and presents several challenges. This paper describes a novel approach to building object-oriented network management software applications, based on work done by the author at the WilTel Advanced Technology Group. The SNMP adaptor object and the Distributor palette object are described; these objects enable an end-user to create a custom network management application and access information from remote SNMP-manageable devices without programming. Due to the flexibility provided by the SNMP adaptor and Distributor palette objects, the enduser can readily refine the application iteratively; the (possibly non-technical) end-user essentially becomes the application designer. This approach to developing network management software greatly reduces application development time, increases productivity and enables the user to adapt the software in real-time to a rapidly changing network environment in a network crisis situation.","PeriodicalId":203232,"journal":{"name":"Proceeding of 13th IEEE Annual International Phoenix Conference on Computers and Communications","volume":"9 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":"127374919","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 Design of a Shared-Buffer based ATM Switch for Broadband ISDN","authors":"S. Kumar, D. Agrawal","doi":"10.1109/PCCC.1994.504141","DOIUrl":"https://doi.org/10.1109/PCCC.1994.504141","url":null,"abstract":"This paper presents a shared buffer ATM switch architecture suitable for broadband integrated services digital networks. This switch mainly consists of 1K ATM-cell memory, a corresponding routing tag memory, two independent but cooperating memory control units along with associated multiplexers/demultiplexers and serial/parallel converters. The proposed shared-buffer switch architecture exploits the parallelization of memory operations required to perform efficient ATM switching with increased ATM cell processing time. A concept of switching efficiency at the hardware level namely, the switching-slot efliciency for a shared buffer ATM switch has been introduced. A design to enhance the switching slot efficiency of a shared buffer ATM switch by parallelizing memory operations within the switch has been proposed. Kevwords ATM switching, B-ISDN, performance evaluation, shared-buffer architecture, switching efficiency.","PeriodicalId":203232,"journal":{"name":"Proceeding of 13th IEEE Annual International Phoenix Conference on Computers and Communications","volume":"195 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":"125663460","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":"A Wavelet-Based Multiple-Access Spread Spectrum Modulation Scheme","authors":"D. Cochran, Chao Wei","doi":"10.1109/PCCC.1994.504154","DOIUrl":"https://doi.org/10.1109/PCCC.1994.504154","url":null,"abstract":"A multiple access communication scheme using wavelet-based orthogonal codes is described. The message bit stream in each channel is encoded as a sequence of time-shifted replicates of a mother wavelet symbol at a particular scale. Different channels use the same wavelet symbol but a different scale. The messages are decodable if the time-shifted and dilated replicates of the wavelet symbol used in the encoding are orthogonal. Variations and potential applications of this scale-division multiple access scheme in low probability of exploitation communication systems are discussed. An example is presented to demonstrate the (Fourier) spectral spreading that can be obtained using this approach.","PeriodicalId":203232,"journal":{"name":"Proceeding of 13th IEEE Annual International Phoenix Conference on Computers and Communications","volume":"113 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":"124525695","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":"A global data management strategy for distributed computing systems","authors":"K. Nwosu, C.Y.R. Coen, P. Berra","doi":"10.1109/PCCC.1994.504090","DOIUrl":"https://doi.org/10.1109/PCCC.1994.504090","url":null,"abstract":"We have presented a global data management strategy for a logic storage space based on storage devices that. are attached to computing systems that may be locally or remotely interconnected via a network. We discussed the functional chwacteristics and capabilities of the strategy vis a vis the current techniques. The processes for the creation, configuration, making file systems, accessing data, extension, and reduction of an Allocatzon Space Area Devzce (ASAD) are described.","PeriodicalId":203232,"journal":{"name":"Proceeding of 13th IEEE Annual International Phoenix Conference on Computers and Communications","volume":"19 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":"130099547","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}