{"title":"A new protection model for component-based operating systems","authors":"Greg Law","doi":"10.1109/PCCC.2000.830360","DOIUrl":"https://doi.org/10.1109/PCCC.2000.830360","url":null,"abstract":"This paper describes a new model of program protection particularly suited to component-based operating systems. Instead of the traditional separate user and kernel processor modes and paging, segmentation is combined with a simple software technique to avoid the use of separate processor modes while maintaining full protection. This new model offers dramatically improved performance, simplified and improved architectures and increased flexibility. A component-based OS (called Go!) has been implemented using such techniques and early experiences with it are described in this paper. In this paper we show that Go! offers fully protected round-trip RPC in just 85 cycles on the Pentium, and the single processor mode allows the Object Request Broker (Go's analogue of a kernel) to be responsible only for component management. We show that such a system allows multithreading, device management, and even interrupt handling to be provided by separate 'application level' components without compromising protection.","PeriodicalId":387201,"journal":{"name":"Conference Proceedings of the 2000 IEEE International Performance, Computing, and Communications Conference (Cat. No.00CH37086)","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-12-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122844038","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":"Developing highly-responsive user interfaces with DHTML and servlets","authors":"Katherine Betz, A. Leff, J. Rayfield","doi":"10.1109/PCCC.2000.830348","DOIUrl":"https://doi.org/10.1109/PCCC.2000.830348","url":null,"abstract":"Due to communication overhead and latency, Web-based user interfaces that rely exclusively on the server to refresh client screens suffer from poor performance. In this paper we show that implementation of the classic model-view-controller architecture on the client enables the client to refresh the screen in certain cases, and thus improves performance. This \"dual-MVC\" approach is discussed in the context of a sample Web-based application.","PeriodicalId":387201,"journal":{"name":"Conference Proceedings of the 2000 IEEE International Performance, Computing, and Communications Conference (Cat. No.00CH37086)","volume":"440 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-02-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115613871","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":"Techniques for efficient cell-level ATM simulations","authors":"M. Aron, L. Brakmo","doi":"10.1109/PCCC.2000.830345","DOIUrl":"https://doi.org/10.1109/PCCC.2000.830345","url":null,"abstract":"This paper investigates the efficiency of a network simulator in simulating ATM networks with UBR service and compares it to the the efficiency of simulating conventional packet networks. A network simulator can be highly inefficient for cell-level ATM simulations as compared to analogous packet network simulations. We motivate and describe three techniques for improving the efficiency of ATM simulations. These techniques afford an increase in efficiency of 29-34% for ATM simulations on the x-sim network simulator.","PeriodicalId":387201,"journal":{"name":"Conference Proceedings of the 2000 IEEE International Performance, Computing, and Communications Conference (Cat. No.00CH37086)","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-02-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126011741","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}
A. Pimentel, L. Hertzberger, P. Struik, P. van der Wolf
{"title":"Hardware versus hybrid data prefetching in multimedia processors: a case study","authors":"A. Pimentel, L. Hertzberger, P. Struik, P. van der Wolf","doi":"10.1109/PCCC.2000.830359","DOIUrl":"https://doi.org/10.1109/PCCC.2000.830359","url":null,"abstract":"Data prefetching is a promising technique for hiding the penalties due to compulsory cache misses. In this paper we present a case study on two types of data prefetching in the context of multimedia processing: a purely hardware-based technique and a more low-cost hybrid hardware/software technique. Moreover, we also propose a technique for increasing the so-called prefetch distance in hardware prefetching and a scheme to reduce trashing in the data cache. Our results demonstrate that the low-cost hybrid prefetching scheme slightly outperforms hardware-based prefetching for the code segments for which both solutions have been applied, while hardware prefetching potentially allows more code to benefit from the prefetching.","PeriodicalId":387201,"journal":{"name":"Conference Proceedings of the 2000 IEEE International Performance, Computing, and Communications Conference (Cat. No.00CH37086)","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-02-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123725172","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 cyclic multi-relation semijoin operation for query optimization in distributed databases","authors":"S. Bandyopadhyay, Q. Fu, A. Sengupta","doi":"10.1109/PCCC.2000.830307","DOIUrl":"https://doi.org/10.1109/PCCC.2000.830307","url":null,"abstract":"In this paper we have introduced the concept of multirelation semijoin and we have shown that it is possible to get substantial reduction in the cost of data communication if a restricted form of this operation called cyclic multi-relation semijoin is used for query optimization in distributed databases. We have proposed a heuristic to identify situations where the cyclic multi-relation semijoin operation is likely to be useful. To study the applicability of this operation and to determine how much additional benefit we may expect, we have augmented a well known semijoin based algorithm with this operation. We have used simulation studies with a large number of queries and our experiments indicate that depending on the characteristics of the database, improvements ranging from 30% to 80% is possible.","PeriodicalId":387201,"journal":{"name":"Conference Proceedings of the 2000 IEEE International Performance, Computing, and Communications Conference (Cat. No.00CH37086)","volume":"474 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-02-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116413636","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":"Move-to-front and transpose hybrid parallel architectures for high-speed data compression","authors":"J. Myoupo, A. Wabbi","doi":"10.1109/PCCC.2000.830303","DOIUrl":"https://doi.org/10.1109/PCCC.2000.830303","url":null,"abstract":"We give linear systolic array architectures for self organising linear lists using two hybrids schemes of move-to-front and transpose heuristics, attempting to incorporate the best of both methodologies. The arrays provide input every clock cycle and have a number of processors equal to the length of the list n. This design is then implemented to build high-speed lossless data compression hardware for data communication and storage that have high compression ratio for both small and large files.","PeriodicalId":387201,"journal":{"name":"Conference Proceedings of the 2000 IEEE International Performance, Computing, and Communications Conference (Cat. No.00CH37086)","volume":"58 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-02-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116751569","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":"Performance evaluation of joint per-VC scheduling and credit-based flow control in high-speed ATM WANs","authors":"S. Jha, P. Zhou, O. Yang","doi":"10.1109/PCCC.2000.830362","DOIUrl":"https://doi.org/10.1109/PCCC.2000.830362","url":null,"abstract":"Per-VC scheduling and credit-based flow control were studied separately in the past. This paper presents the performance evaluation of joint per-VC scheduling and credit-based flow control in a three-node high-speed ATM wide area network. The traffic types used in the study are a combination of delay-sensitive (DS), delay-insensitive (DI) and best effort (BE) qualities of service. At the network level the ATM switches perform credit-based flow control for DI and BE traffic and peak rate allocation for DS traffic. At the node level a per-connection scheduling algorithm is used to determine the eligibility of a connection to transmit cells during a given slot. In this paper we simulate the behavior of the above mentioned network in order to evaluate ifs performance.","PeriodicalId":387201,"journal":{"name":"Conference Proceedings of the 2000 IEEE International Performance, Computing, and Communications Conference (Cat. No.00CH37086)","volume":"494 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-02-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123194660","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":"Simulating Mobile IP based network environments","authors":"P. P. Kannadath, H. El-Rewini","doi":"10.1109/PCCC.2000.830324","DOIUrl":"https://doi.org/10.1109/PCCC.2000.830324","url":null,"abstract":"In this paper we simulate network environments under Mobile IP. We introduce a model that represents the main features in the basic Mobile IP protocol and its optimization schemes. The model incorporates network components and operations that allow mobile computers equipped with wireless network interface to communicate with computers on the fixed network, We present some important details of an event driven object oriented simulator that we developed to study environments with mobile users. In order to show how the simulator can be utilized, we present preliminary results from several experiments conducted using the simulator.","PeriodicalId":387201,"journal":{"name":"Conference Proceedings of the 2000 IEEE International Performance, Computing, and Communications Conference (Cat. No.00CH37086)","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-02-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121410262","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 new matching algorithm for managing location information in mobile computing","authors":"A. D. Sivarama Kumar, T. Camp","doi":"10.1109/PCCC.2000.830323","DOIUrl":"https://doi.org/10.1109/PCCC.2000.830323","url":null,"abstract":"We describe a fully distributed algorithm for location management. It is based on organizing mobile switching stations into a hierarchical network of grids. The interesting properties of this algorithm are symmetric availability for reads and writes, low quorum size, scalability and flexibility. The algorithm is based on a novel solution for the well-known matching problem that is especially suitable in a mobile environment. We compare the performance of our technique against the standard grid protocol and also the more recent Crumbling Walls protocol in terms of read and write availability, quorum size and load. The results and analysis highlight the tradeoffs involved in these various protocols, and show that the proposed algorithm is promising.","PeriodicalId":387201,"journal":{"name":"Conference Proceedings of the 2000 IEEE International Performance, Computing, and Communications Conference (Cat. No.00CH37086)","volume":"71 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-02-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126342772","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 use of call admission control and buffer management for congestion control in LAN interconnection over ATM switches","authors":"H. Hassanein, H. Aboelfotoh, S. K. Habra","doi":"10.1109/PCCC.2000.830313","DOIUrl":"https://doi.org/10.1109/PCCC.2000.830313","url":null,"abstract":"We consider the problem of interconnecting low speed LANs over a high-speed ATM switch. A bottleneck is formed when more than one source originate traffic to the same destination LAN. In this case, congestion may be created at the output gateway (destination LAN interface) and the required services are interrupted. In this paper we propose a new integrated scheme for call admission control (CAC) and buffer management. The objective of the scheme is to prevent the congestion at the destination LANs, as well as within the ATM switch, while minimizing connection rejection rates (maximizing the utilization of the ATM switch). The scheme uses two types of parameters: first, the connection parameters, which are estimated at the network interface unit and specified during connection set-up, and second, the actual traffic characteristics and buffer requirements. The proposed scheme is shown not require intensive computations and can be implemented in real time in a high-speed ATM switch. A simulation model for the system is developed from which the performance of our integrated CAC and buffer management scheme is evaluated. It is shown that the application of our CAC criteria maintains cell/packet dropping to within a same order of magnitude. It is also shown that using virtual buffer allocation, in conjunction with our CAC criteria, results in almost no cell/packet dropping.","PeriodicalId":387201,"journal":{"name":"Conference Proceedings of the 2000 IEEE International Performance, Computing, and Communications Conference (Cat. No.00CH37086)","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-02-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115183038","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}