although several papers have studied no-idle scheduling problems, they all focus on flow shops, assuming one processor at each working stage. but, companies commonly extend to hybrid flow shops by duplicating machines in parallel in stages. this paper considers the problem of scheduling no-idle hybrid flow shops. a mixed integer linear programming model is first developed to mathematically form...

data envelopment analysis (dea) is a non-parametric technique for evaluation of relative efficiency of decision making units described by multiple inputs and outputs. it is based on solving linear programming problems. since 1978 when basic dea model was introduced many its modifications were formulated. among them are two or multi-stage models with serial or parallel structure often called net...

In this paper, we argue that interacting processes (IP) with multiparty interactions are an ideal model for parallel programming. The IP model with multiparty interactions was originally proposed by N. Francez and I. R. Forman [1] for distributed programming of reactive applications. We analyze the IP model and provide the new insights into it from the parallel programming perspective. We show ...

As an increasing number of leadership-class systems embrace GPU accelerators in the race towards exascale, efficient communication data is becoming one most critical components high-performance computing. For developers parallel programming models, implementing support for GPU-aware using native APIs GPUs such as CUDA can be a daunting task it requires considerable effort with little guarantee ...