Abstract: Journey information is mapped by first identifying an acceptable trigger condition type, such as a photo trigger condition type, of a plurality of trigger condition types. Once a journey has begun, a trigger condition of the acceptable trigger condition type may be detected at a mobile computing device, for example when the mobile computing device captures a photo. A location of the mobile computing device is then identified in response to the detection of the trigger condition, and a marker is placed on a map identifying the location. The marker is also associated with data associated with the trigger condition, for example by allowing the photo captured by the mobile computing device to be viewable at the marker.

Abstract: Journey information is mapped by first identifying an acceptable trigger condition type, such as a photo trigger condition type, of a plurality of trigger condition types. Once a journey has begun, a trigger condition of the acceptable trigger condition type may be detected at a mobile computing device, for example when the mobile computing device captures a photo. A location of the mobile computing device is then identified in response to the detection of the trigger condition, and a marker is placed on a map identifying the location. The marker is also associated with data associated with the trigger condition, for example by allowing the photo captured by the mobile computing device to be viewable at the marker.

Abstract: There are provided systems and methods for sharing information across multi-device systems. Such a system includes multiple device node communicatively coupled via a network. Each device node has a hardware processor and a memory storing an inter-node data transfer software code including a data transfer ledger. For each of the device nodes, its hardware processor is configured to execute the inter-node data transfer software code to receive an input data from a data source, process the input data to identify a relevant system data, and generate an output data based on the relevant system data. The inter-node data transfer software code is further executed to transmit the output data to one or more other device nodes, to generate a ledger entry for updating the data transfer ledger, and to broadcast the ledger entry to all others of the device nodes via the network.

Abstract: There are provided systems and methods for mediating data exchange among devices. Such a method includes receiving a data from at least a first registered device having a device profile stored in a device registry, generating a ledger entry corresponding to the data in a data exchange ledger, and transmitting a data availability notification describing the data to one or more other registered devices based on their respective device profiles. The method also includes receiving a data acquisition request for the data from at least a second registered device included among the one or more other registered devices, mediating a transaction for an exchange of the data between the first registered device(s) and the second registered device(s), and updating the ledger entry and the respective device profiles of the first registered device(s) and the second registered device(s) based on the transaction.

Abstract: A method and apparatus of providing high performance and highly scalable storage acceleration includes a cluster node-spanning RAM disk (CRD) interposed in the data path between a storage server and a computer server. The CRD addresses performance problems with applications that need to access large amounts of data and are negatively impacted by the latency of classic disk-based storage systems. It solves this problem by placing the data the application needs into a large (with respect to the server's main memory) RAM-based cache where it can be accessed with extremely low latency, hence improving the performance of the application significantly. The CRD is implemented using a novel architecture which has very significant cost and performance advantages over existing or alternative solutions.

Abstract: A reliable and scalable system and method of broadcasting information to other computer nodes in a communication network requires only O(2) time steps. According to one aspect, after broadcasting data in O(1) steps to all nodes in the network, the system and method provides a distributed reliability protocol to ensure data delivery which only requires an additional O(1) steps. Therefore, unlike in prior art approaches where the root or co-root is responsible for the reliable data delivery, each node in the network takes on responsibility to deliver the message to a partner/neighborhood node. The broadcasting method and system of the can be used as building block for most collective/distributive operations, and provides a significant performance advantage in parallel computer systems that have multicast/broadcast capabilities.

Abstract: A reliable and scalable system and method of broadcasting information to other computer nodes in a communication network requires only O(2) time steps. According to one aspect, after broadcasting data in O(1) steps to all nodes in the network, the system and method provides a distributed reliability protocol to ensure data delivery which only requires an additional O(1) steps. Therefore, unlike in prior art approaches where the root or co-root is responsible for the reliable data delivery, each node in the network takes on responsibility to deliver the message to a partner/neighborhood node. The broadcasting method and system of the can be used as building block for most collective/distributive operations, and provides a significant performance advantage in parallel computer systems that have multicast/broadcast capabilities.

Abstract: A method and system allows for fast compression and decompressing of data using existing repetitive interleaved patterns within scientific data (floating point, integer, and image). An advantage of the method and system is that it is so fast that it can be used to save time due to a lower amount of data transferred/stored in scenarios like network transfer, disk or memory storage, cache storage or any other real-time applications where time plays a crucial role.

Abstract: A method and system allows for fast compression and decompressing of data using existing repetitive interleaved patterns within scientific data (floating point, integer, and image). An advantage of the method and system is that it is so fast that it can be used to save time due to a lower amount of data transferred/stored in scenarios like network transfer, disk or memory storage, cache storage or any other real-time applications where time plays a crucial role.

Abstract: A method and system allows for fast compression and decompressing of data using existing repetitive interleaved patterns within scientific data (floating point, integer, and image). An advantage of the method and system is that it is so fast that it can be used to save time due to a lower amount of data transferred/stored in scenarios like network transfer, disk or memory storage, cache storage or any other real-time applications where time plays a crucial role.

Abstract: A virtual parallel computer is created within a programming environment comprising both shared memory and distributed memory architectures. At run time, the virtual architecture is mapped to a physical hardware architecture. In this manner, a massively parallel computing program may be developed and tested on a first architecture and run on a second architecture without reprogramming.

Abstract: A method and apparatus of providing high performance and highly scalable storage acceleration includes a cluster node-spanning RAM disk (CRD) interposed in the data path between a storage server and a computer server. The CRD addresses performance problems with applications that need to access large amounts of data and are negatively impacted by the latency of classic disk-based storage systems. It solves this problem by placing the data the application needs into a large (with respect to the server's main memory) RAM-based cache where it can be accessed with extremely low latency, hence improving the performance of the application significantly. The CRD is implemented using a novel architecture which has very significant cost and performance advantages over existing or alternative solutions.

Abstract: A virtual parallel computer is created within a programming environment comprising both shared memory and distributed memory architectures. At run time, the virtual architecture is mapped to a physical hardware architecture. In this manner, a massively parallel computing program may be developed and tested on a first architecture and run on a second architecture without reprogramming.

Abstract: A multi-node computing cluster uses a table of data objects within each process to determine if a data object is locally available or on a remote computing node. For those data objects located remotely, a local handler process is able to communicate with a remote handler process on a remote node. The remote handler is capable of retrieving and sending the data object directly from or to the memory of a second process without disturbing the second process, thereby allowing the second process to continually compute. The remote handler may transfer the data object to the local handler, which in turn may place the data object into the memory of the first process.