Browse Prior Art Database

METHOD AND APPARATUS TO MEDIATE AND NORMALISE CUT-N-PASTE OPERATIONS FOR DISTRIBUTED AND LOW CAPACITY DEVICES

IP.com Disclosure Number: IPCOM000200330D
Publication Date: 2010-Oct-06
Document File: 2 page(s) / 42K

Publishing Venue

The IP.com Prior Art Database

Abstract

Mechanism to mediate and normalise cut&paste operations on distributed and low capacity devices

This text was extracted from a PDF file.
This is the abbreviated version, containing approximately 55% of the total text.

Page 01 of 2

METHOD AND APPARATUS TO MEDIATE AND NORMALISE CUT -N-PASTE OPERATIONS FOR DISTRIBUTED AND LOW CAPACITY DEVICES

Disclosed is a mechanism to mediate and normalise cut&paste operations on distributed and low capacity devices. The new step is the inclusion of additional mediation steps for: local capacity available, which may change dynamically depending on the application(s) running locally; and throughput on the connection channel.

    The original problem involves how to ensure that all processes, irrespective of where it runs (user space versus kernel) and what it's input type(s) is, have equal access to objects that may be copied or reviewed. This leads to normalising accesses to a cut&paste buffer based on a ranking of "importance" and the typing the typical input to the processes. When implemented on a low-capacity client device, there is additional issues of:
- dynamically changing local capacity availability - leading to negotiation to off-load to a server; and
- intermittent or variable connectivity - leading to additional persistence management capabilities.

    The novel aspect of this mechanism is also what makes it intelligent, as it should never allow resources in the system to be stretched to the point of hindering performance, especially important on low-capacity client devices. An interconnecting aspect could be achieved by having a central cut&paste buffer shared between these low-capacity devices, especially where the cut&paste buffer has been off-loaded to a server.

    Existing cut&paste operations are often flawed because system resources can be hit hard and performance degraded when the clipboard buffer grows too large, and each interconnected system needs its own cut&paste buffer, resulting in a waste of storage. Also sometimes the buffer limits what can be cut&pasted. With this new mechanism there are no such constraints.

    The new mechanism herein involves monitoring local capacity indicators (CPU, i/o etc) and connection status. When capacity is constrained and/or connectivity intermittent or throughput limited, then objects that might potentially be cut&pasted receive special handling to aid persistence : all input is copied to a temporary buffe...