Servo: a programming model for many-core computing

  • Authors:

  • Nicolas Zea;John Sartori;Rakesh Kumar

  • Affiliations:

  • Coordinated Science Laboratory, Urbana, IL;Coordinated Science Laboratory, Urbana, IL;Coordinated Science Laboratory, Urbana, IL

  • Venue:
  • ACM SIGARCH Computer Architecture News
  • Year:
  • 2008

Quantified Score

Hi-index 0.00

Visualization

Abstract

Conventional programming models were designed to be used by expert programmers for programming for large-scale multiprocessors, distributed computational clusters, or specialized parallel machines. These models, therefore, are deemed either too difficult for an "average" programmer (who will be expected to do parallel programming in the many-core world) or too inefficient to use for many-core architectures [3]. Similarly, conventional execution models were designed for performance, not scalability. To address the challenge of performance scalability for many-core architectures, we introduce Servo, a Service Oriented programming model that decomposes every program into a set of components (each with its own local memory, mutable state, and a program counter) that either request services or deliver services. Servo is characterized by the decoupling of logical communication mapping between program modules (or services) from physical communication mapping between modules. This allows the services to be migrated and replicated during execution. The proposed model also allows the granularity of data parallel operations to be changed dynamically. This allows runtime variation in the locking granularity which in turn enables higher write-parallelism. Finally, the models partition even data into services. This can significantly enhance locality and makes it possible to have superlinear speedups with increasing number of cores. Our preliminary investigations demonstrate significant performance scalability advantages for Servo.