{"title":"Creating an open systems compatible message queueing system","authors":"J. J. Andreula, L. E. Heindel, Refen Koh","doi":"10.1109/PCCC.1994.504088","DOIUrl":"https://doi.org/10.1109/PCCC.1994.504088","url":null,"abstract":"Complex long-lived distributed applications, such as Telecomniunications Provisioning Systems, have been built using the Queued Transaction Processing (QTP) model. Proprietary QTP systems were developed for some of these applications due to the unavailability of commercial systems which could address the requirements of these systems. These QTP systems interconnect various applications running on heterogeneous software and hardware platforms, and have processed large transaction volumes for more than two decades. These applications communicate using structured messages which describe units of work in the QTP system. Vendor-developed Message Queueing Systems are now entering the marketplace. As new systems are developed using vendor solutions, portability and inter-operability among new and existing systems become an issue, especially on platforms where no vendor solutions exist. In this paper, we argue for an Open Systems Compatible Message Queueing System and propose an Open Systems architecture using an asynchronous message-passing facility. This architecture masks choices of operating system from applications as well as masking the more traditional choices of hardware. For complex, long-lived applications, this architecture is a requirement to ensure the success of the application - across both hardware and software platforms updates.","PeriodicalId":203232,"journal":{"name":"Proceeding of 13th IEEE Annual International Phoenix Conference on Computers and Communications","volume":"76 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":"115990649","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":"Data Replication in a Distributed Heterogeneous Database Environment: An Open System Approach","authors":"Yongdong Wang, J. Chiao","doi":"10.1109/PCCC.1994.504132","DOIUrl":"https://doi.org/10.1109/PCCC.1994.504132","url":null,"abstract":"This paper describes an open system approach used by the Sybase replication server for maintaining loose consistency of replicated data in a distributed heterogeneous database environment. In large distributed database systems, the same data are often replicated at multiple sites for quick data access and for high data availability. Because of the high cost of maintaining tight consistency of replicated data, most database systems choose to support loose consistency of replicated dam. The Sybase replication server is a transaction log based database replication system that allows row level data replication. It continuously propagates update transactions committed on the primary copy of data to the replicate copies stored in other databases. Unlike other data replication systems which are developed for specific database systems, the replication server is designed to be a separate process indcpendent of data servers which store the replicated dam. It provides an open system interface to communicate with heterogeneous data servers. The open system interface consists of two parts: the log transfer interface for accepting the log records for transactions executed on the primary copy of data, and the function string interface for users to translate commands in replicated transactions before they are applied to the databases containing replicate copies of data. The open log transfer interface makes it possible to replicate data from any databases that provide an interface to access their transaction logs. The open function string interface makes it easier to replicate data to databases through simple passthrough gateways. It also provides the flexibility for users to customize how transactions should be applied. We believe the replication server provides an important step towards providing practical solutions to data replication in large distributed database environments, most of which have data in heterogeneous databases.","PeriodicalId":203232,"journal":{"name":"Proceeding of 13th IEEE Annual International Phoenix Conference on Computers and Communications","volume":"26 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":"115639601","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":"Synthesizing communication gateways from protocol and service specifications","authors":"K. Saleh, M. Jaragh, O. Rafiq","doi":"10.1109/PCCC.1994.504105","DOIUrl":"https://doi.org/10.1109/PCCC.1994.504105","url":null,"abstract":"","PeriodicalId":203232,"journal":{"name":"Proceeding of 13th IEEE Annual International Phoenix Conference on Computers and Communications","volume":"28 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":"114437387","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":"Computer-Aided System Design Assessment Tool","authors":"E. Andert, L. Peters","doi":"10.1109/PCCC.1994.504114","DOIUrl":"https://doi.org/10.1109/PCCC.1994.504114","url":null,"abstract":"Current system design support methodologies and tools u-e insufficient for the complexity encountered in today's iistributed and real-time systems development. Support :echniques inadequately communicate requirements and do not issist in the complex task of identifying critical components md problem areas. This paper discusses a prototype Intelligent System Design Assessment Tool (ExpeWT) that integrates requirements specification, system design, design analysis, and design evaluation. It provides the client and engineer with an automated tool that identifies critical and problem areas in a design and suggests improvements. The tool approach utilizes an innovative combination of expert system analysis, graphical system design, and design modeling/simulation. The project builds on the commercial ProTEMTM graphical system design diagramming and simulation tool.","PeriodicalId":203232,"journal":{"name":"Proceeding of 13th IEEE Annual International Phoenix Conference on Computers and Communications","volume":"31 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":"121628126","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":"Systematic Trellis-coded Modulation on Multipath Fading ISI Channels","authors":"E. Katz, G. Stuber","doi":"10.1109/PCCC.1994.504153","DOIUrl":"https://doi.org/10.1109/PCCC.1994.504153","url":null,"abstract":"The concept of systematic trellis-coded modu- lation (STCM) is presented as an effective means of performing coded modulation on multipath fading IS1 channels. Due to the special construction of STCM codes, a dual mode receiver can be employed; conventional sequence estimation is used when the channel is satisfactory, and systematic decoding is used when the channel exhibits a deep fade. Because the bit error rate is dominated by the code performance during a deep fade, STCM codes with even a modest asymptotic coding gain have an over- all performance that is better than previously reported trellis- codes with large asymptotic coding gain. I Introduction","PeriodicalId":203232,"journal":{"name":"Proceeding of 13th IEEE Annual International Phoenix Conference on Computers and Communications","volume":"5 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":"122119648","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":"Implementing right to know security in the computer based patient record","authors":"K. Bobis","doi":"10.1109/PCCC.1994.504107","DOIUrl":"https://doi.org/10.1109/PCCC.1994.504107","url":null,"abstract":"Alrstmct The advent of tke Computer-based Patient Reeord (CPR) has initiated much discussion concerning tlre problems involved with meving the CPR from concept to reality. The issues raised include the content of the CPR, its cost, eEects on system performance, and its legal aspects. Conspicuously absent in most of these discussions is the need for a clearly defined security structure which would control the daily use of the CPR by healthcare professionals.","PeriodicalId":203232,"journal":{"name":"Proceeding of 13th IEEE Annual International Phoenix Conference on Computers and Communications","volume":"42 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":"133640670","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":"Distributed Systems Management Based On OSI Environment: Problems, Solutions, And Their Evaluation","authors":"S. Park, N. Shiratori","doi":"10.1109/PCCC.1994.504142","DOIUrl":"https://doi.org/10.1109/PCCC.1994.504142","url":null,"abstract":"Distributed Systems Managemen (DSM) will be significant issue within information network i n order to increase the high reliability and to improve the flexibility of network management. The OSI management model has several problems. The key problems are that it does not fully address the problem of,first,how to define system architecture suitable for distributed management environment, second,how to develop communica t ion protocol in support of DSM, and,third,how to classify the management informations. I n this paper, to solve f irst problem described above, we introduce the basic structure of distributed network management system ( D N M S ) with intelligent facilities for efficient network management, and also especially give the concrete design o f system management application process which is an important element among them. A n d to overcome second problem, we propose the connectionless CMIP to accomplish fo r effectively manag ing the d is t r ibu ted m a n a g e m e n t system, and indicate its eff iciency; t h i s protocol i s available to negotiate among the managing systems, to handle the dynamic informations. To work out third problem, we introduce the connection criteria i n the h i e rarchy o f m a n a g e m e n t s y s t e m s , compare t h e conventional centralized systems management with the proposed distributed systems management, and finally evaluate the efficiency o f a suggested protocol dur ing cooperative negotiation among the managing systems.","PeriodicalId":203232,"journal":{"name":"Proceeding of 13th IEEE Annual International Phoenix Conference on Computers and Communications","volume":"154 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":"114854392","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":"Parallel Min-max-pair Heap","authors":"M. Medidi, N. Deo","doi":"10.1109/PCCC.1994.504133","DOIUrl":"https://doi.org/10.1109/PCCC.1994.504133","url":null,"abstract":"Priority deques allow, in addition to the priorityqueue operations of inserting an element and deleting the largest element, the deletion of the smallest element. Data structures like min-max heap, deap, minmax-pair heap, and interval heap, described in the literature, for implementing priority deques achieve only O(1ogn)-parallelism, where n is the number of elements. To alleviate this bottleneck, we present the parallel min-max-pair heap, a new parallel data structure for priority deques, which achieves a pfold parallelism with p processors for all p 5 n. First, we describe how it supports deletion of p largest elements, deletion of p smallest elements, and insertion of p elements in O(log n logp) time using p processors on the exclusive-read exclusive-write (EREW) parallel random-access machine (PRAM). Then, to obtain cost-optimal parallel algorithms, we show that the operations can be pipelined on this structure and that p operations can be handled in O(1ogn) time with p processors.","PeriodicalId":203232,"journal":{"name":"Proceeding of 13th IEEE Annual International Phoenix Conference on Computers and Communications","volume":"183 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":"132965615","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 Tests and Flexible Decoding for Transfer Syntax in Real-time Applications","authors":"M. Bassiouni, M. Loper","doi":"10.1109/PCCC.1994.504104","DOIUrl":"https://doi.org/10.1109/PCCC.1994.504104","url":null,"abstract":"interconnect heterogeneous machines and eliminate their incompatibilities. However, the interoperability benefit of OS1 stacks could be offset by the computational overhead a s soc ia t ed wi th the complex da ta transformation process of OS1 upper layers. In this paper, we summarize the results of a performance evaluat ion s tudy on the overhead of the OSI/ASN. 1 transfer syntax. An approach for a modified transfer syntax that allows for the flexible decoding of transmitted PDUs at the receiving host is also discussed.","PeriodicalId":203232,"journal":{"name":"Proceeding of 13th IEEE Annual International Phoenix Conference on Computers and Communications","volume":"29 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":"125671136","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":"Fast Path Routing Techniques for Nonblocking Broadcast Networks","authors":"Yuanyuan Yang, G. Masson","doi":"10.1109/PCCC.1994.504138","DOIUrl":"https://doi.org/10.1109/PCCC.1994.504138","url":null,"abstract":"I n a nonblocking broadcast network, any broadcast connection request from an idle network input port to a set of idle network outputports can be realized without any disturbance (that is, rearrangement) of other existing connections. Nonblocking broadcast networks have important applications in parallel and distributed processing. The network controller used for determining connection path routings figures critically in the performance of an interconnection network, particularly in real-time parallel and distributed processing applications. I n this paper, we will present designs of a network controller for the currently best available explicit constructions of nonblocking broadcast switching networks with a constant number of stages. For a three-stage nonblocking broadcast network of the type we consider wherein there are r switch modules in each of the first and third stages with n input ports and n output ports on each of these switch modules, i t will be seen that a network controller can determine connection path routings to satisfy a broadcast connection request in O( ,:if;,.) gate propagations. The designs will also be generalzzed to multi-stage networks in the same order of path routing time. This contrasts favorably with the O(nr) steps required in the previous software control algorithm. Furthermore, even the most hardware intensive of the controller designs is comparable in logic circuitry to that of one switching module. The network controller designs presented in this paper render the nonblocking broadcast networks we consider useful in real-time parallel and distributed processing applications which require high-speed network connection path set-ups.","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":"129087302","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}