The present invention relates to distributed computing systems which are capable of efficiently utilizing processing capabilities of multiple devices. More specifically, the present invention provides a grid computing system, and related method of use, which utilizes available computing cycles of mobile phones.
Grid computing is presently utilized to address many complex computing tasks. Generally speaking, a grid computing system includes a number of separate computing devices, all registered to provide computing capacity when necessary. Generally speaking, computing devices on the grid are made available at certain times to take on defined computing tasks when not otherwise being used. In one typical method, availability is invoked by screen savers operating on the remote computing device. More specifically, the starting and operation of a screen saver thus indicates that the computing device is not presently being utilized and available for additional tasks.
The use of idle computing power creates a general conflict in society. Generally speaking, this conflict involves computing needs versus power consumption. Utilizing the above-mentioned technique invoked by screen savers requires that the computing device in question be continuously “operational”. In this state, some level of power is continuously consumed by the computer, thus requiring some level of energy use. Conservationists would prefer that idle computing devices simply be shut down, thus not capable of consuming any power. In this state, complete energy conservation is more achievable. As should be obvious, this creates a natural conflict that does not have an easy solution.
As one potential alternative, it is possible to look to other products and computing devices which may provide better alternatives. Candidates for possible use may include mobile computing devices or mobile phones which typically are powered to remain operational. However, communication with such devices, and the ability to make use of their potential processing power, is complicated due to available communication bandwidths, etc. Additionally, computing power may also be somewhat limited, thus narrowing the type of projects which may potentially be appropriate.
The present invention makes use of computing power available in mobile computing devices and specifically mobile phones. These devices are good candidates for grid computing applications as they are continuously powered and available for potential assignments. Additionally, the present invention provides an appropriate communication protocol which allows for efficient communication between the computing systems and mobile phones.
Generally speaking, the present invention utilizes available mobile phones which are registered as clients on a grid computing system. When assignments are available, the system detects availability of these clients, and pushes computing projects to the mobile phones for processing during available processing cycles. These processing projects are communicated utilizing a communication protocol appropriate for mobile phones. More specifically, the computer projects are communicated via SMS text messages, which can easily be handled by the phone and the mobile network carrying the communication.
In order to allow the communication of sizeable amounts of data, the assignments are communicated in a compressed communication methodology which will more efficiently pass computing projects as necessary. This communication methodology generally involves the communication of a lookup table, and subsequent communication of data which can be decompressed utilizing the received lookup table. In this manner, discrete SMS text messages can be sent which contain portions of the overall message. Similarly, the mobile phone can also communicate back to the grid computing system in this same manner.
Using these techniques, mobile phones can be incorporated into a grid communication system without requiring continuous network connection. Further, existing messaging capabilities are utilized to provide message communication in an efficient manner.
Further objects and advantages of the present invention can be seen by reading the following detailed description, in conjunction with the drawings in which:
The grid computing system of the present invention makes use of existing communication networks and existing capabilities to provide additional computing power. One embodiment of grid computing system 10 is illustrated in
As generally discussed above, the present invention utilizes the existing processing power of mobile phones, which are typically continuously powered and oftentimes in idle states of operation. Referring to
Grid computing system 10 of the present invention contemplates the use of various types of agents for additional processing power. That said, the availability of “noncontinuously connected” agents is specifically contemplated. The most obvious of these devices are mobile phones, as mentioned above, since they are not typically network connected at all times, however are available via cellular communication techniques. As such, the grid service of the present invention provides capabilities to make contact with these agents when necessary. Stated alternatively, the present invention will broadcast or push work to the agents making up the grid computing system. Consequently, agents themselves are not responsible for monitoring or checking availability at all, rather simply respond to received messages.
Referring again to
Referring now to
Once the problem is partitioned appropriately, portions are transmitted to available agents at step 54. Again, users will register their phone number with the grid system, or the grid system will maintain a record of registered users. Naturally, the method of transmission for the present invention can be carried out in different ways. In one embodiment, the message is generally transmitted to a large number of potential users (general broadcast method). Alternatively, the message may be targeted to a specific user. In either case, grid service 20 then waits for appropriate confirmation at step 56.
Similar processing steps must obviously be carried out by the mobile phone during processing. The following description will refer to the use of first mobile phone 30 as the processing agent, however, it will be understood that any one of the mobile phones part of the grid service would carry out similar steps. Again, mobile phone 30 in the process of the present invention will receive a project from grid service at step 60 via an appropriate SMS message. In this particular embodiment, mobile phone 30 will then transmit a confirmation back to grid service 20 at step 62 thus indicating their availability to accept the transmitted task.
As one alternative, not shown in
Returning to the flowchart of
Due to the size limitations of typical SMS messages, the present invention sends chunks of the message as compressed payloads. Typically, the type of data used in these grid processing projects includes arrays of floating point numbers. In these applications, the data does not need to be streamed but rather needs to be highly compressed. As such, a compression scheme can be used whereby the entire data set, at the grid service 20, is broken into multiple small chunks (a), and then processed for frequency occurrence of sequences of data, to thus provide a lookup table for that chunk. The data in the particular chunk identified is then compressed using the frequency lookup table and divided into a number of smaller chunks (b), with each of these smaller chunks being within the SMS size limitation (i.e. less than 160 bytes in size).
To aid in transmission, the frequency lookup table is then compressed using standard well known compression techniques so that it will also fit within the SMS size limitations. The present invention then transmits this lookup table as the first SMS message to the mobile phone. This lookup table will be uniquely identified by the nature of the SMS messages being sent. For example, a first identifier bit may be a “1”, thus identifying the remainder of the message as a lookup table, wherein a first bit of “0” identifies the remainder as data.
Referring again to
Generally speaking, the system outlined above uses a combination of standard compression for bootstrapping the rest of the message sequence using an adaptive compression scheme for each particular data set. While this particular technique has been found appropriate for the embodiment outlined above, further compression techniques could be utilized in order to appropriately fit messages.
While certain embodiments in the invention have been described above, they are not intended to be limiting in any way, but rather illustrative of the concepts of the present invention. That said, the applicant intends the invention to include all variations and modifications coming within the scope and spirit of the following claims.
Number | Name | Date | Kind |
---|---|---|---|
5588152 | Dapp et al. | Dec 1996 | A |
5590345 | Barker et al. | Dec 1996 | A |
5625836 | Barker et al. | Apr 1997 | A |
5708836 | Wilkinson et al. | Jan 1998 | A |
5710935 | Barker et al. | Jan 1998 | A |
5713037 | Wilkinson et al. | Jan 1998 | A |
5717943 | Barker et al. | Feb 1998 | A |
5717944 | Wilkinson et al. | Feb 1998 | A |
5734921 | Dapp et al. | Mar 1998 | A |
5752067 | Wilkinson et al. | May 1998 | A |
5754871 | Wilkinson et al. | May 1998 | A |
6496871 | Jagannathan et al. | Dec 2002 | B1 |
6681242 | Kumar et al. | Jan 2004 | B1 |
6920331 | Sim et al. | Jul 2005 | B1 |
6996699 | Chrysanthakopoulos et al. | Feb 2006 | B2 |
7020678 | Hubbard | Mar 2006 | B1 |
7058944 | Sponheim et al. | Jun 2006 | B1 |
7086055 | Stringham | Aug 2006 | B2 |
7178049 | Lutter | Feb 2007 | B2 |
7395536 | Verbeke et al. | Jul 2008 | B2 |
7434000 | Barreh et al. | Oct 2008 | B1 |
7437733 | Manzano | Oct 2008 | B2 |
20020120660 | Hay et al. | Aug 2002 | A1 |
20020184288 | Vargas et al. | Dec 2002 | A1 |
20040192354 | Sawano | Sep 2004 | A1 |
20050015571 | Kaufman et al. | Jan 2005 | A1 |
20050076338 | Malik | Apr 2005 | A1 |
20050132372 | Vargas et al. | Jun 2005 | A1 |
20060031509 | Ballette et al. | Feb 2006 | A1 |
20060070067 | Lowery | Mar 2006 | A1 |
20060107266 | Martin et al. | May 2006 | A1 |
20060224597 | Fitzpatrick et al. | Oct 2006 | A1 |
20060294238 | Naik et al. | Dec 2006 | A1 |
20070198977 | Abernethy et al. | Aug 2007 | A1 |
20070250446 | Zalewski | Oct 2007 | A1 |
20070300225 | Macbeth et al. | Dec 2007 | A1 |
20080005327 | Hays | Jan 2008 | A1 |
20080005736 | Apacible et al. | Jan 2008 | A1 |
20080028405 | Martin et al. | Jan 2008 | A1 |
20080209416 | De Souza et al. | Aug 2008 | A1 |
20080250408 | Tsui et al. | Oct 2008 | A1 |
20080256539 | Barde et al. | Oct 2008 | A1 |
Number | Date | Country |
---|---|---|
1 605 595 | Dec 2005 | EP |
2006054856 | May 2006 | KR |