International Business Machines Corporation

Marisa S Viveros

David Frederick Bantz

Daniel M Gruen

Lorraine M Herger

Ponani S Gopalakrishnan

Dennis Gerard Shea

Nathan J Lee

Yun Yu Wang

Mir Hamid Pirahesh

Jen-Yao Chung

Patricia G Selinger

Partha Pratim Bhattacharya

Nicholas Sewall Bowen

Lawrence Peter Zaino

A virtual workspace is provided for a user with a number of electronic devices, in which information can be exchanged among the electronic devices through a number of connections between the electronic devices. The virtual workspace is provided by determining where services are located and the type of the services, determining one or more data formats associated with data accessible by one or more of the electronic devices. A portion of the data has a given one of one or more data formats. An electronic device is selected based at least in part on predetermined criteria and the given data format. A route through the connections to the selected electronic device is determined, where the route may comprise a given one or more of the connections. At least the portion of the data associated with the given data format is routed to the selected electronic device. The portion of the data is utilizable for presentation by the selected electronic device when received by the selected electronic device.

Techniques for providing a virtual workspace comprised of a multiplicity of electronic devices

In a connection arrangement including two or more electronic devices, wherein information can be exchanged among the electronic devices through a plurality of communication links between the electronic devices, at least one of the electronic devices being configurable for communicating with a data source, a method for presenting a multi-channel message originating from the data source, the multi-channel message including a two or more components, includes the steps of allocating each of at least a portion of the components in the multi-channel message to at least one electronic device and, for each allocated component, determining possible communication paths between the data source and the at least one electronic device allocated to the corresponding component. The method further includes the steps of selecting, based at least in part on one or more selection criteria, at least one of the possible communication paths for the allocated components, each of the selected communication paths representing an optimal route between the data source and the at least one electronic device allocated to the corresponding component, and routing each of the allocated components in the multi-channel message according to the selected communication paths for presentation of the allocated components by the corresponding electronic device(s).

Electronic device connection resource management

We disclose a method for reliable message delivery between three parties in a network of mobile devices. This method consists of augmenting the services provided by a Network Service Provider (NSP) or a similar entity with a method combining store-and-forward of messages and a token which is stored in the mobile computer. This token represents an identifier of the last point-of-presence used for connecting to the network and it is used for inquiring about previous requests. Thereby, guaranteeing delivery of requests in spite of lack of resources availability.

Method for reliable message delivery in a network of mobile computers

A method of performing a parallel join operation on a pair of relations R1 and R2 in a system containing P processors organized into Q clusters of P/Q processors each. The system contains disk storage for each cluster, shared by the processors of that cluster, together with a shared intermediate memory (SIM) accessible by all processors. The relations R1 and R2 to be joined are first sorted on the join column. The underlying domain of the join column is then partitioned into P ranges of equal size. Each range is further divided into M subranges of progressively decreasing size to create MP tasks T.sub.m,p, the subranges of a given range being so sized relative to one another that the estimated completion time for task T.sub.m,p is a predetermined fraction that of task T.sub.m-1,p. Tasks T.sub.m,p with larger time estimates are assigned (and the corresponding tuples shipped) to the cluster to which processor p belongs, while tasks with smaller time estimates are assigned to the SIM, which is regarded as a universal cluster (cluster 0). The actual task-to-processor assignments are determined dynamically during the join phase in accordance with the dynamic longest processing time first (DLPT) algorithm. Each processor within a cluster picks its next task at any given decision point to be the one with the largest time estimate which is owned by that cluster or by cluster 0.

Method of performing a parallel relational database query in a

Growing community of inventors

Dobbs Ferry, NY, United States of America

Marisa S Viveros