Download presentation
Presentation is loading. Please wait.
Published byWilliam Hood Modified over 8 years ago
1
JICOS A Java-Centric Network Computing Service Peter Cappello & Christopher James Coakley Computer Science University of California, Santa Barbara
2
API Goals Application program is oblivious to: –Number of processors –Processor topology –Inter-process communication –Faulty compute servers
3
API Divide & Conquer (DAC) f(3)f(2) + f(1) f(0) + + f(1)f(0) + f(4)
4
API DAC Common environment –Input object –Shared object f(3)f(2) + f(1) f(0) + + f(1)f(0) + f(4)
5
Architectural Goals Scalable Heterogeneous processors & OS Mobile code Support adaptively parallel computation Tolerate faulty compute servers Reduce or hide communication latency
6
Architecture H H H H H H S H H H H H H
7
M C login setComputation getResult logout
8
Hiding Communication Latency Task Caching f(3)f(2) + f(1) f(0) + + f(1)f(0) + f(4)
9
Hiding Communication Latency Task Pre-fetching f(3)f(2) + f(1) f(0) + + f(1)f(0) + f(4)
10
Hiding Communication Latency Execute Task on Server f(3)f(2) + f(1) f(0) + + f(1)f(0) + f(4)
11
Tolerating Faulty Hosts Transactions kill performance
12
Tolerating Faulty Hosts Transactions kill performance
13
Tolerating Faulty Hosts ProxyH TASKS Proxy TASKS TASK H
14
Performance Experiments Problem: 200-city TSP –61,295 BranchAndBound Tasks (2.05s) –30,647 MinSolution Tasks (< 1ms) 120-processor experiments use 3 processor types (CX journal paper derives formula)
16
Fault Tolerance Experiments Problem: 200-city TSP Killed p processors after 1,500s, for p = 2, 6, 20, 24, 26, 30. % overhead: actual time / ideal time H H H H H H H H H H H H H H H H S 32 PROCESSORS
17
Fault Tolerance Experiments
18
Task Server Overhead H H H H H H H H H H H H H H H S/H H H H H H H H H H H H H H H H H S 22 PROCESSORS 11 HOSTS, 1 SERVER 12 MACHINES TIME: 3114.8s 22 PROCESSORS 11 HOSTS, 1 SERVER 11 MACHINES TIME: 3115.1s
19
Conclusions API = Cilk + Common Task Environment Architecture –network of servers, each serving many hosts. –Supports adaptive parallelism –Efficiently tolerates faulty hosts Excellent speedups –2 processors (1 Host): 9 hours and 32 minutes –120 processors: < 12 minutes (96.66 % ideal) –3 application-controlled latency-hiding directives Small Server overhead: Run Host on Server
20
THANK YOU! URL: cs.ucsb.edu/projects/jicos Download System Source Tutorial
22
A Distributed Computing Taxonomy NOT Application fixes processor topology a priori Adaptively parallelNOT Tolerates faulty computer serversNOT Divide & Conquer API NOT
23
Ancestry CilkLinda AtlasSatinJavelinCX JICOS Pirannha
Similar presentations
© 2024 SlidePlayer.com. Inc.
All rights reserved.