Groupware reflects a change in emphasis from using the computer to solve problems to using the computer to facilitate human interaction. This article describes categories and examples of groupware and discusses some underlying research and development issues. GROVE, a novel group editor, is explained in some detail as a salient groupware example

/pdf/groupware-some-issues-and-experiences-3o63d5bi23.pdf

Groupware: some issues and experiences

An automated communications system operates to transfer data, metadata and methods from a provider computer to a consumer computer through a communications network. The transferred information controls the communications relationship, including responses by the consumer computer, updating of information, and processes for future communications. Information which changes in the provider computer is automatically updated in the consumer computer through the communications system in order to maintain continuity of the relationship. Transfer of metadata and methods permits intelligent processing of information by the consumer computer and combined control by the provider and consumer of the types and content of information subsequently transferred. Object oriented processing is used for storage and transfer of information. The use of metadata and methods further allows for automating may of the actions underlying the communications, including communication acknowledgements and archiving of information. Service objects and partner servers provide specialized data, metadata, and methods to providers and consumers to automate many common communications services and transactions useful to both providers and consumers. A combination of the provider and consumer programs and databases allows for additional functionality, including coordination of multiple users for a single database.

Computer-based communication system and method using metadata defining a control-structure

In summary, the present invention is an information and advertising distribution system. A data server stores and updates a database of information items and advertisements. The information items and advertisements are each categorized so that each has an associated information category. Workstations remotely located from the data server each include a display device, a communication interface for receiving at least a subset of the information items and advertisements in the data server's database and local memory for storing the information items and advertisements received from the data server. An information administrator in each workstation establishes communication with the data server from time to time so as to update the information items and advertisements stored in local memory with at least a subset of the information items and advertisements stored by the data server. An information display controller in each workstation displays on the workstation's display device at least a subset of the information items and advertisements stored in local memory when the workstation meets predefined idleness criteria. At least a subset of the workstations include a profiler for storing subscriber profile data. The subscriber profile data represents subscriber information viewing preferences, indicating information categories for which the subscriber does and does not want to view information items. The information display controller includes a filter for excluding from the information items displayed on the display device those information items Inconsistent with the subscriber profile data.

Information and advertising distribution system and method

An intelligent automated assistant system engages with the user in an integrated, conversational manner using natural language dialog, and invokes external services when appropriate to obtain information or perform various actions. The system can be implemented using any of a number of different platforms, such as the web, email, smartphone, and the like, or any combination thereof. In one embodiment, the system is based on sets of interrelated domains and tasks, and employs additional functionally powered by external services with which the system can interact.

Intelligent Automated Assistant

System for allowing user of any computer to draw image over that generated by the host computer and replicating the drawn image to other computers

A multi-user collaborative system in which the contents as well as the current status of other user activity of a shared structured data object representing one or more related structured data objects in the form of data entries can be concurrently accessed by different users respectively at different workstations connected to a common link. The WYSIWIS user interface representation of the shared structured data object includes an ordered listing of such entries that are maintained by the structured data object and various attributes of each listed entry, inter alia, the type and class of entry; the revision number of the shared structured data object; the number of pages and revision number of each structured data object entry; the date of creation and last revision of each such entry; whether an entry can be accessed by a user and, if not, who has prevented such access to prevent concurrent editing; whether a local instance of an entry is present on a user's system; and a provision for miscellaneous notes or comments relative to each entry for view by other users. Means is provided for maintaining current information relative to the shared structured object and its entries on a user initiated demand updated basis invoked by a user operation, which operation requires updated information to properly implement the operation.

Representation of collaborative multi-user activities relative to shared structured data objects in a networked workstation environment

A multi-user collaborative system in which the contents as well as the current status of other user activity of a shared structured data object representing one or more related structured data objects in the form of data entries can be concurrently accessed by different users respectively at different workstations connected to a common link. The WYSIWIS user interface representation of the shared structured data object includes an ordered listing of such entries that are maintained by the structured data object and various attributes of each listed entry, inter alia, the type and class of entry; the revision number of the shared structured data object; the number of pages and revision number of each structured data object entry; the date of creation and last revision of each such entry; whether an entry can be accessed by a user and, if not, who has prevented such access; whether a local instance of an entry is present on a user's system; and a provision for miscellaneous notes or comments relative to each entry for view by other users. Means is provided for maintaining current information relative to the shared structured object and its entries on a user initiated demand updated basis invoked by a user operation, which operation requires updated information to properly implement the operation. Further, means is provided for locking up one or more data entries by an individual user and thereby prevent access of the locked entries by other users to prevent concurrent editing and other changes to the same entries by two or more users. In this connection, editing or modification cannot be performed by a user until the shared structured data object entry or entries have been locked up. Visual indication as to the locked state of entries and other information relative to the locking user and the time of lock is updated and displayed in the shared structured data object representation present at user workstations when a use invokes a user operation on the shared structured data object or its contents.

Updating local copy of shared data in a collaborative system

Programmers have traditionally used locks to synchronize concurrent access to shared data. Lock-based synchronization, however, has well-known pitfalls: using locks for fine-grain synchronization and composing code that already uses locks are both difficult and prone to deadlock. Transactional memory provides an alternate concurrency control mechanism that avoids these pitfalls and significantly eases concurrent programming. Transactional memory language constructs have recently been proposed as extensions to existing languages or included in new concurrent language specifications, opening the door for new compiler optimizations that target the overheads of transactional memory.This paper presents compiler and runtime optimizations for transactional memory language constructs. We present a high-performance software transactional memory system (STM) integrated into a managed runtime environment. Our system efficiently implements nested transactions that support both composition of transactions and partial roll back. Our JIT compiler is the first to optimize the overheads of STM, and we show novel techniques for enabling JIT optimizations on STM operations. We measure the performance of our optimizations on a 16-way SMP running multi-threaded transactional workloads. Our results show that these techniques enable transactional memory's performance to compete with that of well-tuned synchronization.

/pdf/compiler-and-runtime-support-for-efficient-software-tofw09k0nt.pdf

Compiler and runtime support for efficient software transactional memory

Many processors today integrate a CPU and GPU on the same die, which allows them to share resources like physical memory and lowers the cost of CPU-GPU communication. As a consequence, programmers can effectively utilize both the CPU and GPU to execute a single application. This paper presents novel adaptive scheduling techniques for integrated CPU-GPU processors. We present two online profiling-based scheduling algorithms: naive and asymmetric. Our asymmetric scheduling algorithm uses low-overhead online profiling to automatically partition the work of data-parallel kernels between the CPU and GPU without input from application developers. It does profiling on the CPU and GPU in a way that it doesn't penalize GPU-centric workloads that run significantly faster on the GPU. It adapts to application characteristics by addressing: 1) load imbalance via irregularity caused by, e.g., data-dependent control flow, 2) different amounts of work on each kernel call, and 3) multiple kernels with different characteristics. Unlike many existing approaches primarily targeting NVIDIA discrete GPUs, our scheduling algorithm does not require offline processing. We evaluate our asymmetric scheduling algorithm on a desktop system with an Intel 4th generation Core processor using a set of sixteen regular and irregular workloads from diverse application areas. On average, our asymmetric scheduling algorithm performs within 3.2% of the maximum throughput with a perfect CPU-and-GPU oracle that always chooses the ideal work partitioning between the CPU and GPU. These results underscore the feasibility of online profile-based heterogeneous scheduling on integrated CPU-GPU processors.

http://www.cs.utexas.edu/~rashid/public/pact2014.pdf

Adaptive heterogeneous scheduling for integrated GPUs

A method and apparatus for generating a platform-standard object file containing machine-independent abstract code. Source code which defines a procedure is convened into abstract code which makes no assumptions about the platform on which the procedure will be executed. An abstract code platform-standard object file is generated based on the abstract code. The abstract code platform-standard object file includes a list of definitions of any global variables defined in the abstract code, a list of symbol references indicative of any external variables or external procedures referenced in the abstract code, a sequence of machine instructions for calling an execution routine when a client calls the procedure, and the abstract code which defines the procedure. The abstract code is preferably compressed before it is stored in the abstract code platform-standard object file. When a program including the abstract code platform-standard object file is executed, it is dynamically linked to the execution routine. When the procedure is called, the execution routine is invoked. The execution routine executes the procedure by interpreting the abstract code or generating machine-code responsive to the abstract code. The execution routine may be an execution control unit which selects between various execution techniques based on runtime factors, such as the frequency with which the procedure is called.

Brian T. Lewis

Papers

Representation of collaborative multi-user activities relative to shared structured data objects in a networked workstation environment

Updating local copy of shared data in a collaborative system

Compiler and runtime support for efficient software transactional memory

Adaptive heterogeneous scheduling for integrated GPUs

Method and apparatus for generating platform-standard object files containing machine-independent code