Sample Applications Sample Clauses

Sample Applications. Licensee agrees to deliver to Verity one (1) ------------------- copy of the Application upon the first commercial shipment of the Application. Licensee grants to Verity a worldwide, nonexclusive, nontransferable, royalty- free and fully-paid right and license solely to use such copy for purposes of support of the Application.

Sample Applications. Licensee agrees to deliver to Verity ten (10) copies of a Demo Disk Application within thirty (30) days of execution of this Agreement. Licensee grants to Verity a worldwide, nonexclusive, nontransferable, royalty-free and fully-paid right and license solely to use such copies internally and to demonstrate such copies to existing and potential customers for marketing purposes subject to the terms and conditions set forth for each Demo Disk.

Sample Applications. Licensee agrees to deliver to Verity ten (10) copies of the Application upon the first commercial shipment of the Application. Licensee grants to Verity a worldwide, nonexclusive, nontransferable, royalty-free and fully-paid right and license solely to use such copies internally and to demonstrate such copies to existing and potential customers for marketing purposes.

Sample Applications. ‌ Listing 1 presents an application implemented with CRUCIAL. This simple program is a multi- threaded Monte Carlo simulation that approximates the value of π. It draws a large number of random points and computes how many of them fall in the circle enclosed by the unit square. The ratio of points falling in the circle converges with the number of trials toward π/4 (line 25). The application first defines a regular Runnable class that carries the estimation of π (lines 1 to 17). To parallelize its execution, lines 23 and 24 run a fork-join pattern using a set of CloudThread in- stances. The shared state of the application is a counter object (line 5). This counter maintains the total number of points falling into the circle, which serves to approximate π. It is updated by the threads concurrently using the addAndGet method (line 15). The previous fork-join pattern can also be implemented using the ServerlessExecutorService. In this case, we simply replace lines 19 to 24 in Listing 1 with the content of Listing 2. A second application is shown in Listing 3. This program outputs an image approximating the Mandelbrot set (a subset of ) with a gradient of colors. The output image is stored in a CRUCIAL shared object (line 3). To create the image, the application computes the color of each pixel (line 5). The color indicates when the pixel escaped from the Mandelbrot set (after a bounded number of 1 public class Mandelbrot implements Serializable { 2 @Shared(key = "mandelbrotImage") 3 private MandelbrotImage image = new MandelbrotImage(); 5 private static int[] computeRow(int row, int width, int height, int maxIters) {...} 7 private void compute() { 8 image.init(COLUMNS, ROWS); 9 ServerlessExecutorService se = new ServerlessExecutorService();

Sample Applications. ‌ Listing 1 presents an application implemented with CRUCIAL. This simple program is a multi- threaded Monte Carlo simulation that approximates the value of π. It draws a large number of random points and computes how many fall in the circle enclosed by the unit square. The ratio of points falling in the circle converges with the number of trials toward π/4 (line 25). The application first defines a regular Runnable class that carries the estimation of π (lines 1–17). To parallelize its execution, lines 23–24 run a fork-join pattern using a set of CloudThread instances. The shared state of the application is a counter object (line 5). This counter maintains the total number of points falling into the circle, which serves to approximate π. It is updated by the threads concurrently using the addAndGet method (line 15). The previous fork-join pattern can also be implemented using the ServerlessExecutorService. In this case, we simply replace lines 19–24 in Listing 1 with the content of Listing 2. 1 public class PiEstimator implements Runnable{ 2 private final static long ITERATIONS = 100_000_000; 3 private Random rand = new Random(); 4 @Shared(key="counter") 5 crucial.AtomicLong counter = new crucial.AtomicLong(0); 7 public void run(){ 8 long count = 0;