DOC PREVIEW
UMD CMSC 433 - Distributed Computing

This preview shows page 1 out of 3 pages.

Save
View full document
View full document
Premium Document
Do you want full access? Go Premium and unlock all 3 pages.
Access to all documents
Download any document
Ad free experience
Premium Document
Do you want full access? Go Premium and unlock all 3 pages.
Access to all documents
Download any document
Ad free experience

Unformatted text preview:

1Distributed ComputingCMSC 433, March 27th2Is distributing computingdifferent?• What kinds of distributed computingenvironments exist?• Ways in which distributed computing isdifferent– Addressing objects– Latency– Partial failure– Concurrency3Distributed computingenvironments• Usually refers to multiple CPU’s• Shared address space or message passing?• On same chip, in same room, or across theinternet?– Latency, failure modes4Existing environments• Seti @ Home• Server for search engine• My laptop, PDA, cell phone, MP3 playerand digital camera5Types of failure• Machine sleeps– wakes up, recovers state• Machine crash or failure– machine may reboot and rejoin• Network partition– network may heal6Uniform view of distributedobjects• Some objects are remote, some are local– Doesn’t really matter to user of object– Objects might transparently migrate• Design doesn’t have to take objectdistribution into account• Failure and performance issues don’t belongin the design• The interface doesn’t change if an object isremote27Uniform view• not appropriate for– wide area networks,– consumer electronics,– portable devices• appropriate for some local area networks– but robust distributed applications plan forfailure– even if local8Memory access• Can we make the fact that an object isremote transparent?• Perhaps for objects– What about int’s ?– What about char *’s?• If you can’t directly access fields and createpointers to them,– not transparent9Partial failure• Computers fail• OS’s crash• Networks fail• PDA’s get turned off or taken out of theroom• Often no warning10Queue example• Want to add x to remote queue q– q.enqueue(x)• Operation could fail• Want to reliably enqueue x11Queue example• while (true) {try { q.enque(x);break;}catch (RemoteException e) {}}12Partial failure• Object was enqueued, but failure occurredduring return message• Could enqueue x multiple times• How to fix?– Need a request tag so that duplication enqueuerequests can be detected313Concurrency• Distributed computations mandatesconcurrency14Latency• Remote calls are much more expensive thanlocal calls15Latency• Making a call to an object on a remotemachine is


View Full Document

UMD CMSC 433 - Distributed Computing

Documents in this Course
Trace 1

Trace 1

62 pages

Reflection

Reflection

137 pages

Testing

Testing

25 pages

Paradigms

Paradigms

10 pages

Testing

Testing

17 pages

Java RMI

Java RMI

17 pages

Java RMI

Java RMI

17 pages

Java RMI

Java RMI

17 pages

Trace 1

Trace 1

46 pages

Jini

Jini

4 pages

Final

Final

15 pages

Java RMI

Java RMI

13 pages

Testing

Testing

16 pages

Load more
Download Distributed Computing
Our administrator received your request to download this document. We will send you the file to your email shortly.
Loading Unlocking...
Login

Join to view Distributed Computing and access 3M+ class-specific study document.

or
We will never post anything without your permission.
Don't have an account?
Sign Up

Join to view Distributed Computing 2 2 and access 3M+ class-specific study document.

or

By creating an account you agree to our Privacy Policy and Terms Of Use

Already a member?