Sideband computing

Sideband computing

Sideband computing is a general term for an area of computer science that is related to the distributed computing and multiple communication channels.

Sideband is defined as when a user connects to some normal network service, a separate communication channel is opened through which a server distributes tasks to the clients. Through sideband computing method, any network server which has a lot of clients can form into a large-scale super-computing network. During this process, the resources in the clients could be utilized through the central server so long as the main channel is maintained.

In general, task could be any task that is performed by individual client and used in the various distributed computing environment such as Social computing, Volunteer computing, and Edge computing, Grid Computing, or Utility Computing. Collaborative task in social computing is one example.

Sideband computing is also a type of super computing where each client carries out some real computation tasks that could be the individually executed. With the server aggregating the results from each client, it effectively achieves the function of a real super-computer.

History

Sideband computing is first coined by Yongyong Xu in a paper titled “Global Sideband Service Distributed Computing Method” on a conference “Communication Networks and Distributed System Modeling and Simulation (CNDS’98) on January 1998.

In this paper, a fractal image distributed task was implemented as a demo to the power of distributed computing.

Advantage

Sideband computing maximizes the participation and involvement of clients who are connecting with the server so that every client could help to contribute. With little cost, the network server can act as a supercomputer.

Most other distributed computing requires each client to manually install client side software, proactively participate in the computing and the computation is the sole objective of such client side software.

With sideband computing, sideband service stays along with a regular network service, which allows the sideband services being served without much interrupting to the main network service that is less intrusive and more user-friendly to the end user.

On a different view, a client can be viewed as paying its “contributing” in exchange of the regular service it is served. This is similar to volunteering computing

Disadvantage

Sideband computing requires a regular network service being performed beforehand. Without the main network service, it is not called sideband method.

Applicable Fields

Ajax and Web 2.0 are claimed to be one of the area where sideband method is used. It is said that Ajax is conducted through asynchronously though additional channel other than a browser-server’s main HTTP channel.

Examples of sideband computing in this sense include collaborative filtering, online auctions, online ranking, mashing up, prediction markets, reputation systems, computational social choice, tagging, and verification games using Ajax.

A typical setup would involve that the server allows each client to do a small amount of work and the server coordinates and aggregates results every client to form a larger picture.

For instance, when sideband computing applies to the social computing based on each client creating or recreating social conventions and social contexts through the use of client’s computing resource, software and technology.

Many social networking services, which utilize The Wisdom of Crowds, such as Wikis, social bookmaking, blogging, instant messaging, online bidding, and other kinds of electronic market or electronic negotiation platforms where people interact socially, could found the trace of sideband method.

Another application of the sideband computing method is P2P, where a peer could not only a client or a server, in addition, it also acts as other roles including routing, proxying, caching.

Other claimed area of the sideband computing method are grid computing, clouding computing, cluster computing and utility computing where a node could perform functions more than its primary duty through a sideband channel.

Intellectual Property

A Patent 6,418,462 is granted to the sideband computing method. It is filed on January 7, 1999 and granted on July 9, 2002.

Licensing and validity of the patent claims is unknown yet.

ee also

*Social computing
*Volunteer computing
*Grid computing
*Utility computing
*Edge computing
*Cloud computing
*Ajax
*Web 2.0
*P2P
*Clusters


Wikimedia Foundation. 2010.

Игры ⚽ Нужна курсовая?

Look at other dictionaries:

  • Sideband — The power of an AM signal plotted against frequency. Key: fc is the carrier frequency, fm is the maximum modulation frequency In radio communications, a sideband is a band of frequencies higher than or lower than the carrier frequency, containing …   Wikipedia

  • Volunteer computing — is a type of distributed computing in which computer owners donate their computing resources (such as processing power and storage) to one or more projects .It is distinct from grid computing, which involves sharing ofmanaged computing resources… …   Wikipedia

  • Comparison of Nvidia graphics processing units — For information on AMD (previously ATI) graphics processing units, see Comparison of AMD graphics processing units. This page contains general information about Nvidia s GPUs and videocards based on official Nvidia specifications. Contents 1… …   Wikipedia

  • Amplitude modulation — Passband modulation v · d · e Analog modulation AM · …   Wikipedia

  • Analytic signal — Not to be confused with Analytic function. In mathematics and signal processing, the analytic representation of a real valued function or signal facilitates many mathematical manipulations of the signal. The basic idea is that the negative… …   Wikipedia

  • Otto Julius Zobel — Born October 20, 1887(1887 10 20) Ripon, Wisconsin Died January 1970 (age 82) Morristown, New Jersey …   Wikipedia

  • Orthogonal frequency-division multiplexing — Passband modulation v · d · e Analog modulation AM · …   Wikipedia

  • Bit rate — Bit rates Decimal prefixes (SI) Name Symbol Multiple kilobit per second kbit/s 103 megabit per second Mbit/s 106 gigabit per second Gbit/s 109 …   Wikipedia

  • Hilbert transform — In mathematics and in signal processing, the Hilbert transform is a linear operator which takes a function, u ( t ), and produces a function, H ( u )( t ), with the same domain. The Hilbert transform is named after David Hilbert, who first… …   Wikipedia

  • LSB — Least Significant Bit (Computing » Drivers) Least Significant Bit (Academic & Science » Electronics) Least Significant Bit (Computing » General) Least Significant Bit (Governmental » NASA) *** Linux Standard Base (Computing » General) ** Least… …   Abbreviations dictionary

Share the article and excerpts

Direct link
Do a right-click on the link above
and select “Copy Link”