Abstract: Methods and systems allow for the creation, management and use of networks of people that trust each other in order to enable them to collaborate to transport objects or people. Information of users wishing to send objects or people is matched thereby with people having the capability to perform the transportation.

Abstract: The invention provides the mechanism, hereinafter referred to as Flexible Dynamic Partitioning (FDP), to allocate and reallocate resources among scheduling schemes of many types for multicomputing environments. Resources can include, but are not limited to, processors, disks and communications connections. Partitioning of resources can be initiated by both application and system triggers. Once dynamic partitioning is triggered, FDP allows a partition to invoke a set of resource allocation functions associated with its partition. The reallocation function performs a set of resource matchings and determine the necessary resource movement among partitions.

Abstract: A system and method whereby a gang scheduling entity assembles a schedule of application tasks to be run on a plurality of distributed parallel processors for pre-set time intervals. The scheduling information, including an ordered set of applications and the length of the time interval, are provided to each of the node level schedulers for the relevant processors, and the node level schedulers assure that the tasks of the applications are executed, with context switching between tasks being controlled at the node level. Tasks from multiple applications can be scheduled simultaneously, with time sharing and space sharing being utilized in the schedule. The inventive system is dynamically scalable, with the gang scheduling entity restructuring the matrix schedule should dynamic re-partitioning result in addition or deletion of processors.