Abstract: Disclosed is a method and system for providing access to multimedia content on-line which is updated virtually simultaneously with the vendor's update process. By a user accessing a page on the World Wide Web, for example, data (encrypted and unencrypted) and instructions are automatically downloaded to a user's computer system for quick access. Depending upon the user's computer system (LAN or a stand-alone personal computer), "applets" containing data and instructions are stored for immediate access. In a Karaoke application of this invention, where the user desires to access songs which are most popular at a given time, the user accesses a page where a song list and other information is displayed on a display apparatus. When the user clicks on a particular song of the song list, the applet executes an authentication request. If the user is authenticated, the authentication is downloaded as part of the applet containing the desired multimedia content (or separately depending upon the circumstances). According to this invention, an applet includes multimedia elements which further include timing codes and a synchronization function which provides for the synchronization of the delivery of the multimedia elements.

Abstract: Using techniques from active control theory, we demonstrate that a coupled Lorenz system can be synchronized The synchronization is verified using the Simulink feature in MATLAB

Abstract: Data dependence speculation is used in instruction-level parallel (ILP) processors to allow early execution of an instruction before a logically preceding instruction on which it may be data dependent. If the instruction is independent, data dependence speculation succeeds; if not, it fails, and the two instructions must be synchronized. The modern dynamically scheduled processors that use data dependence speculation do so blindly (i.e., every load instruction with unresolved dependences is speculated). In this paper, we demonstrate that as dynamic instruction windows get larger, significant performance benefits can result when intelligent decisions about data dependence speculation are made. We propose dynamic data dependence speculation techniques: (i) to predict if the execution of an instruction is likely to result in a data dependence mis-specalation, and (ii) to provide the synchronization needed to avoid a mis-speculation. Experimental results evaluating the effectiveness of the proposed techniques are presented within the context of a Multiscalar processor.

Abstract: Disclosed herein is a system for synchronizing object instances between first and second object stores. The system includes a primary computer and a portable computer that is connectable with the primary computer for data communications. A first object store manager executes on the portable computer to maintain the first object store, and a second object store manager executes on the primary computer to maintain the second object store. In addition, a synchronization manager executes on the primary computer. The synchronization manager compares object instances from the first and second object stores in response to initially connecting the portable computer for data communications with the primary computer, and synchronizes any objects whose instances differ from each other. After the initial synchronization, the first object store manager initiates a notification to the synchronization manager whenever an instance of a particular object in the first object store changes. In response, the synchronization manager synchronizes the instances of the identified object in the first and second object stores.

Abstract: A computer software system includes interdependent collections of software components. That is, at the architectural level, software components and their interdependencies are two distinct equally important entities. The software components represent the core functional pieces of an application and deal with concepts specific to an application domain. Interdependencies relate to concepts orthogonal to the problem domain in most applications, such as transportation, sharing of resources and synchronization constraints among components. An architectural description language which represents activities and dependencies between activities as separate entities. Dependencies are managed by coordination processes associated with the dependency. Activities and dependencies are connected through ports which encode interfaces between activities and coordination processes. The language may also represent resources which may be understood as the output of some activity beyond the scope of the system. Each entity, i.e., activity, dependency, port or resource, may also have attributes which are name value pairs, specifying additional information about the entity. Attributes may be inherited. That is, activities and dependencies may be specialized into particular versions of an activity or dependency. The attributes for a particular activity are inherited by its specializations. An editor repository and design assistant may be based on this language to provide a system that automatically generates executable code.

Abstract: Described is a mechanism for dependably managing web synchronization and tracking operations among multiple consumer browsers. A session is created for each of one of the consumer browsers when an individual consumer downloads an initial web page from an HTTP server. A unique ID is assigned to that session. After the session has been created for an individual browser, the information about all activities from that consumer browser will be recorded into the session. Such a mechanism overcomes the difficulty to organize and manage the activities from the multiple consumer browsers that are stateless in nature. An administration browser can select any one of the sessions created, display the activities previously performed in that session, and conduct bi-direction synchronization with the consumer browser associated with the selected session.

Abstract: A method and system for associating, synchronizing and reconciling files. Associated files are synchronized and their synchronization status reported. Based on the synchronization status, the operating system recommends a preferred reconciliation action. Furthermore, file conflicts are recognized and an application interface for computer applications is provided to allow conflicting files to be merged.

Abstract: This paper is concerned with system support for nonblocking synchronization in shared-memory multipr~ cesaors. Many non-blocking algorithms published recently depend on the Load-Linked (L L), Validate (VL), and Store-Con<ional (SC) instructions. However, most systems support either Compare-and-Swap (CAS) or a weak form of LL and SC that imposes several restrictions on the use of these instructions and does not provide the exact semantics expected and assumed by algorithm designers. These limitations currently render several recent non-blocking algorithms inapplicable in most systems. The results presented here eliminate this problem by providing practical means for implementing any algorithm that is based on these instructions on any multiprocessor that provides either CAS or a form of LL and SC that is sufficiently weak that it is provided by all current hardware implementations of these instructions. This is achieved in two steps. First, we propose a slight modification to the interface for LL, VL, and SC, which will not greatly impact programmers. We then exploit this modification to provide time-optimal, space-efficient implementations of the desired primitives using commonly available ones.

Abstract: Described is a mechanism for dependably organizing and managing information for web synchronization and tracking among multiple consumer browsers. A session is created for each of one of the consumer browsers when an individual consumer downloads an initial web page from an HTTP server. A unique ID is assigned to that session. After the session has been created for an individual browser, the information about the all activities from that consumer browser will be recorded into the session. Such a mechanism overcomes the difficulty to organize and manage the activities from the multiple consumer browsers that are in stateless nature.

Abstract: By considering generalized synchronizable chaotic systems, the drive-auxiliary system variables are combined suitably using encryption key functions to obtain a compound chaotic signal. An appropriate feedback loop is constructed in the response-auxiliary system to achieve synchronization among the variables of the drive-auxiliary and response-auxiliary systems. We apply this approach to transmit analog and digital information signals in which the quality of the recovered signal is higher and the encoding is more secure.

Abstract: This paper presents dynamic feedback, a technique that enables computations to adapt dynamically to different execution environments. A compiler that uses dynamic feedback produces several different versions of the same source code; each version uses a different optimization policy. The generated code alternately performs sampling phases and production phases. Each sampling phase measures the overhead of each version in the current environment. Each production phase uses the version with the least overhead in the previous sampling phase. The computation periodically resamples to adjust dynamically to changes in the environment.We have implemented dynamic feedback in the context of a parallelizing compiler for object-based programs. The generated code uses dynamic feedback to automatically choose the best synchronization optimization policy. Our experimental results show that the synchronization optimization policy has a significant impact on the overall performance of the computation, that the best policy varies from program to program, that the compiler is unable to statically choose the best policy, and that dynamic feedback enables the generated code to exhibit performance that is comparable to that of code that has been manually tuned to use the best policy. We have also performed a theoretical analysis which provides, under certain assumptions, a guaranteed optimality bound for dynamic feedback relative to a hypothetical (and unrealizable) optimal algorithm that uses the best policy at every point during the execution.

Abstract: From the Publisher: Distributed Operating Systems and Algorithms integrates into one text both the theory and implementation aspects of distributed operating systems for the first time. This innovative book provides the reader with knowledge of the important algorithms necessary for an in-depth understanding of distributed systems; at the same time it motivates the study of these algorithms by presenting a systems framework for their practical application. The first part of the book is intended for use in an advanced course on operating systems and concentrates on parallel systems, distributed systems, real-time systems, and computer networks. The second part of the text is written for a course on distributed algorithms with a focus on algorithms for asynchronous distributed systems. While each of the two parts is self-contained, extensive cross-referencing allows the reader to emphasize either theory or implementation or to cover both elements of selected topics. Features: Integrates and balances coverage of the advanced aspects of operating systems with the distributed algorithms used by these systems. Includes extensive references to commercial and experimental systems to illustrate the concepts and implementation issues. Provides precise algorithm description and explanation of why these algorithms were developed. Structures the coverage of algorithms around the creation of a framework for implementing a replicated server-a prototype for implementing a fault-tolerant and highly available distributed system. Contains programming projects on such topics as sockets, RPC, threads, and implementation of distributed algorithmsusing these tools. Includes an extensive annotated bibliography for each chapter, pointing the reader to recent developments. Solutions to selected exercises, templates to programming problems, a simulator for algorithms for distributed synchronization, and teaching tips for selected topics are available to qualified instructors from Addison Wesley.

Abstract: A method and apparatus for preserving audio and video presentation synchronization during the splicing operation by selectively deleting, if necessary, an audio/video access unit to avoid overlapping of audio/video frames in the spliced output stream.

Abstract: A graphical programming system and method which includes three-dimensional nodes that are wired or connected to from a graphical program or block diagram. Each of the three-dimensional nodes includes a plurality of sides that are designed to receive pre-defined inputs. In one embodiment, each node includes a left side for receiving data input and a right side for producing output data. The upper or top side of each node is designed to receive inputs regarding error conditions and/or initialization information. The front side of each node is reserved for displaying the name of the node or the function performed by the node. The back side of each node is reserved for timing and synchronization inputs. The bottom side of each node is designed to receive base configuration information and/or type declaration information. The user is only allowed to connect data of the specified type to the designated inputs of each node. If the user attempts to connect the wrong type of data to a respective input side of a node, the connection is broken, thus alerting the user of the problem. Therefore, the graphical programming system of the present invention simplifies the assembly process and provides increased error checking. The user can also manipulate or rotate the graphical program or block diagram to view different sides and thus view different classes of inputs.

Abstract: A technique for optimizing throughput on a communications channel shared by multiple users. A communications channel that must be shared by a large number of devices has the potential of being very inefficient because of collisions or overlapping of transmissions by the various devices. The system combines a carrier sense, multiple access (CSMA) mode with a time division multiple access (TDMA) mode to achieve a channel utilization greater than 90 percent. The remote units send a poll request to a base station using the CSMA mode and receive a poll signal from the base station with a poll sequence. The remote units send their data in their assigned time slot. The remote units do not have to all be in radio contact with each other to maintain synchronization. Each remote unit selects the base station that it wishes to communicate with based on signal strength of various base stations. The remote units may switch from one base station to another by addressing the selected base station and using the selected base station's synchronization data pattern in radio transmissions from the remote unit. The synchronization data pattern may be different for each base station or may be identical for groups of base stations to provide broader regional control of the communications network. The base station will only communicate with remote units using the synchronization code for that base station. The system also recovers data from a more powerful signal that collides with a weaker signal by examining the received data for the synchronization code from the more powerful signal.

Abstract: A computer implemented method and a computer program for synchronizing a first and a second database, where data is provided for keeping track of whether the records of the first database have been added or changed since a previous synchronization. Based data reflecting whether the records of the first database have been added or changed since a previous synchronization, it is determined whether the records of the first database have been changed or added since the previous synchronization. If one of the records of the first database has not been changed or added since the previous synchronization, a synchronization with records of the second database is performed using a record representative of the one record at the time of a previous synchronization. The representative record is stored in a history file which contains records reflecting the contents of records of the databases at the time of a previous synchronization.

Abstract: In this dissertation, we show how a relatively simple and extremely fast interprocedural optimization algorithm can be used to optimize many of the expensive features of statically typed, object-oriented languages--in particular, C++ and Java. We present a new program analysis algorithm, Rapid Type Analysis, and show that it is fast both in theory and in practice, and significantly out-performs other "fast" algorithms for virtual function call resolution. We present optimization algorithms for the resolution of virtual function calls, conversion of virtual inheritance to direct inheritance, elimination of dynamic casts and dynamic type checks, and removal of object synchronization. These algorithms are all presented within a common framework that allows them to be driven by the information collected by Rapid Type Analysis, or by some other type analysis algorithm. Collectively, the optimizations in this dissertation free the programmer from having to sacrifice modularity and extensibility for performance. Instead, the programmer can freely make use of the most powerful features of object-oriented programming, since the optimizer will remove unnecessary extensibility from the program.

Abstract: Static Single Assignment (SSA) form has shown its usefulness as a program representation for code optimization techniques in sequential programs. We introduce the Concurrent Static Single Assignment (CSSA) form to represent explicitly parallel programs with interleaving semantics and post-wait synchronization. The parallel construct considered in this paper is cobegin/coend. A new confluence function, the π-assignment, which summarizes the information of interleaving statements between threads, is introduced. The Concurrent Control Flow Graph, which contains information about conflicting statements, control flow, and synchronization, is used as an underlying representation for the CSSA from. An extension of the Sparse Conditional Constant propagation algorithm based on the CSSA form makes it possible to apply the constant propagation optimization to explicitly parallel programs.

Abstract: Keywords: chaos ; Non-Linear Signal Processing Reference LANOS-CONF-1997-015 Record created on 2004-12-03, modified on 2017-05-12

Abstract: A computer program for an interactive computer music game is stored on a medium that can be read by a general purpose computer. When read and executed, the program causes the computer to perform functions, including associating a music track on a user compact disc (CD) inserted in the computer's CD-ROM drive with a selected song associated with a music track on a reference CD, and synchronizing music data stored by the computer to the music track on the user CD, where the music data has been derived from the music track on the reference CD associated with the selected song. The program generates user-CD data characteristic of the digital data on the user-CD track, and compares the user-CD data with reference-CD data characteristic of the digital data on the reference-CD track. Based upon the comparison, the computer generates a synchronization function characteristic of timing differences between the reference-CD track and the user-CD track, and adjusts the timing of the music data with the synchronization function. The comparison can include determining a correlation function between the sets of data.

Abstract: An important attribute in the specification of many compute-intensive applications is “time”. Simulation of interactive virtual environments is one such domain. There is a mismatch between the synchronization and consistency guarantees needed by such applications (which are temporal in nature) and the guarantees offered by current shared memory systems. Consequently, programming such applications using standard shared memory style synchronization and communication is cumbersome. Furthermore, such applications offer opportunities for relaxing both the synchronization and consistency requirements along the temporal dimension. In this work, we develop a temporal programming model that is more intuitive for the development of applications that need temporal correctness guarantees. This model embodies two mechanisms: “delta consistency” – a novel time-based correctness criterion to govern the shared memory access guarantees, and a companion “temporal synchronization” – a mechanism for thread synchronization along the time axis. These mechanisms are particularly appropriate for expressing the requirements in interactive application domains. In addition to the temporal programming model, we develop efficient explicit communication mechanisms that aggressively push the data out to “future” consumers to hide the read miss latency at the receiving end. We implement these mechanisms on a cluster of workstations in a software distributed shared memory architecture called “Beehive.” Using a virtual environment application as the driver, we show the efficacy of the proposed mechanisms in meeting the real time requirements of such applications.

Abstract: A computer implemented method is provided for synchronizing a first database located on a first computer and a second database located on a second computer. At the first computer, it is determined whether a record of the first database has been changed or added since a previous synchronization, using a first history file located on the first computer comprising records representative of records of the first database at the completion of the previous synchronization. If the record of the first database has not been changed or added since the previous synchronization, the first computer sends the second computer information which the second computer uses to identify the record of the first database to be unchanged.

Abstract: A data processing device uses a portion of a random access memory as an output buffer for holding a frame of PCM sample data which is being output after being processed by a processing unit within the processing device. Fine grained synchronization between a reference clock and a stream of PCM data frames is provided by transferring only a portion of selected frame of PCM sample data PCM(n+1), in response to a time difference 971. A breakpoint address is determined to delineate the portion of the selected frame that is to be transferred. A sorted list of the addresses of the discontinuities is maintained in breakpoint queue. Since the buffer is managed in a FIFO manner, a single breakpoint register is sufficient to monitor addresses as they are provided by an address register for accessing the random access memory. When a breakpoint is detected, the breakpoint queue and the breakpoint register is updated by an update task 802.

Abstract: The conceptual modeling of workflows is the first, and arguably the most important, step towards understanding business processes A well-defined workflow conceptual model leads to the development of an effective and reliable workflow application This paper presents a graphical modeling technique for workflows We introduce four graphical modeling objects: task, condition, synchronizer, and flow Using the four modeling objects, following workflow modeling constructs are identified: ordering, alternative, exclusive join, concurrency, synchronization, iteration, start/stop, nesting, and contingency It is possible to easily get into error situations while building large workflow specifications We present a set of constraints for ensuring the correctness of workflow specifications The concepts introduced in this paper are applied as a foundation to the development of a CASE tool for the modeling and syntactical verification of workflow graphs

Abstract: A multi-display video system for ensuring the proper synchronization of scene switching. Before each display switches to pixel data corresponding to the next scene to be rendered, new pixel data is written into a currently unused bank of frame buffer memory within a corresponding graphics accelerator. When each graphics accelerator in the video system has completed writing the new pixel data to its respective frame buffer, the scene switch may take place. Each graphics accelerator is configured to display an image corresponding to the next scene in response to the indicator output signal indicating that the pixel data updates for all graphics accelerators are complete.

Abstract: We show that the synchronization of chaotic systems can be achieved by using the observer design techniques which are widely used in the control of dynamical systems. We prove that local synchronization is possible under relatively mild conditions and global synchronization is possible if the chaotic system has some special structures, or can be transformed into some special forms. We show that some existing synchronization schemes for chaotic systems are related to the proposed observer-based synchronization scheme. We prove that the proposed scheme is robust with respect to noise and parameter mismatch under some mild conditions. We also give some examples including the Lorenz and Rossler systems and Chua's oscillator which are known to exhibit chaotic behavior, and show that in these systems synchronization by using observers is possible.

Abstract: A method of linear dynamic output feedback for master-slave synchronization of two identical Lur'e systems is introduced. In this scheme, synchronization is obtained using one or at least fewer measurement signals and control signals than the number of state variables of the Lur'e system. A sufficient condition for global asymptotic stability of the error system is derived from a quadratic Lyapunov function and is expressed as a matrix inequality. The dynamic controller is designed by solving a constrained nonlinear optimization problem. The method is demonstrated on Chua's circuit and a hyperchaotic circuit consisting of 2-double scroll cells.

Abstract: A timing synchronization method and apparatus for processing a compressed information stream comprising a plurality of information segments representative of a sequence of information frames. Information segments representative of information frames are deleted in response to an indicium of buffer overutilization.