EDBT 2026 Demo / reviewers in the wild / expert
Saniya Ben Hassen
dblp:51/4394
· DBLP profile ↗
4ranked-venue papers
3as first author
0since 2021 · last 1998
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Systems, architecture and hardware · 2 · 1 first-authorSoftware engineering, systems software and programming languages · 2 · 2 first-author
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Computer architecture, parallel and distributed computing, and storage systems
2 papers |
Distributed systems · 42% Parallel and multicore computing · 38% Memory systems · 15% |
Topics — the 8 heaviest of 8, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Parallel and multicore computing
parallel programming models |
0.0 | 2 | 1998 | A Task- and Data-Parallel Programming Language Based on Shared Objects · ACM Trans. Program. Lang. Syst. 1998 A Flexible Operation Execution Model for Shared Distributed Objects · OOPSLA 1996 |
Memory systems › shared memory
distributed shared memory |
0.0 | 1 | 1998 | A Task- and Data-Parallel Programming Language Based on Shared Objects · ACM Trans. Program. Lang. Syst. 1998 |
Distributed systems › replication › data replication
object replication |
0.0 | 1 | 1998 | A Task- and Data-Parallel Programming Language Based on Shared Objects · ACM Trans. Program. Lang. Syst. 1998 |
Distributed systems
object sharing |
0.0 | 1 | 1998 | A Task- and Data-Parallel Programming Language Based on Shared Objects · ACM Trans. Program. Lang. Syst. 1998 |
Parallel and multicore computing › parallel programming models
task and data parallelism |
0.0 | 1 | 1998 | A Task- and Data-Parallel Programming Language Based on Shared Objects · ACM Trans. Program. Lang. Syst. 1998 |
Distributed systems
distributed object systems |
0.0 | 1 | 1996 | A Flexible Operation Execution Model for Shared Distributed Objects · OOPSLA 1996 |
Storage systems › distributed storage
consistency semantics |
0.0 | 1 | 1998 | A Task- and Data-Parallel Programming Language Based on Shared Objects · ACM Trans. Program. Lang. Syst. 1998 |
Parallel and multicore computing
parallel programming runtimes |
0.0 | 1 | 1998 | A Task- and Data-Parallel Programming Language Based on Shared Objects · ACM Trans. Program. Lang. Syst. 1998 |
Methods — techniques the papers use, named apart from their topics
remote forking · 0.0object partitioning · 0.0replication · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 1998 | A Task- and Data-Parallel Programming Language Based on Shared ObjectsabstractMany programming languages support either task parallelism, but few languages provide a uniform framework for writing applications that need both types of parallelism or data parallelism. We present a programming language and system that integrates task and data parallelism using shared objects. Shared objects may be stored on one processor or may be replicated. Objects may also be partitioned and distributed on several processors.Task parallelism is achieved by forking processes remotely and have them communicate and synchronize through objects. Data parallelism is achieved by executing operations on partitioned objects in parallel. Writing task-and data-parallel applications with shared objects has several advantages. Programmers use the objects as if they were stored in a memory common to all processors. On distributed-memory machines, if objects are remote, replicated, or partitioned, the system takes care of many low-level details such as data transfers and consistency semantics. In this article, we show how to write task-and data-parallel programs with our shared object model. We also desribe a portable implementation of the model. To assess the performance of the system, we wrote several applications that use task and data parallelism and excuted them on a collection of Pentium Pros connected by Myrinet. The performance of these applications is also discussed in this article. Saniya Ben Hassen, Henri E. Bal, Ceriel J. H. Jacobs |
ACM Trans. Program. Lang. Syst. | 1 |
| 1996 | Integrating Task and Data Parallelism Using Shared ObjectsabstractSupporting both task and data parallelism in one programming system is useful, since many applications need both types of parallelism. We present a programming model that integrates task and data parallelism using shared objects. The model is a generalization of shared objects in Orca. Orca is a task parallel language that uses shared objects for communication between processes and for storing shared (possibly replicated) data. Our new model also uses shared objects for partitioning of shared data and for distribution of work in a data parallel way. Data parallelism is introduced by executing operations on a partitioned object in parallel. The paper describes the design of the new model, its implementation, and its usage for parallel applications that use mixed task and data parallelism. 1 Introduction Most parallel programming systems are based either on data parallelism or on task parallelism. The advantage of data parallelism is that it is easy to use. The programmer merely specifi... Saniya Ben Hassen, Henri E. Bal |
International Conference on Supercomputing | 1 |
| 1996 | A Flexible Operation Execution Model for Shared Distributed ObjectsabstractMany parallel and distributed programming models are based on some form of shared objects, which may be represented in various ways (e.g., single-copy, replicated, and partitioned objects). Also, many different operation execution strategies have been designed for each representation. In programming systems that use multiple representations integrated in a single object model, one way to provide multiple execution strategies is to implement each strategy independently from the others. However, this leads to rigid systems and provides little opportunity for code reuse. Instead, we propose a flexible operation execution model that allows the implementation of many different strategies, which can even be changed at runtime. We present the model and a distributed implementation of it. Also, we describe how various execution strategies can be expressed using the model, and we look at applications that benefit from its flexibility. 1 Introduction Shared objects have become a popular model... Saniya Ben Hassen, Irina Athanasiu, Henri E. Bal |
OOPSLA | 1 |
| 1994 | Object-based approach to programming distributed systemsabstractAbstract Two kinds of parallel computers exist: those with shared memory and those without. The former are difficult to build but easy to program. The latter are easy to build but difficult to program. In this paper we present a hybrid model that combines the best properties of each by simulating a restricted object‐based shared memory on machines that do not share physical memory. In this model, objects can be replicated on multiple machines. An operation that does not change an object can then be done locally, without any network traffic. Update operations can be done using the reliable broadcast protocol described in the paper. We have constructed a prototype system, designed and implemented a new programming language for it, and programmed various applications using it. The model, algorithms, language, applications and performance will be discussed. Andrew S. Tanenbaum, Henri E. Bal, Saniya Ben Hassen, M. Frans Kaashoek |
Concurr. Pract. Exp. | 3 |