Nested-parallel programming models, where the task graph associated to a computation is series-parallel, present good analysis properties that can be exploited for scheduling, cost estimation or automatic mapping to different architectures. In this work we present a preliminary framework approach to exploit some of these advantages. In our framework we reconstruct an application task graph from a high-level specification, where no scheduling or communication details are yet expressed. The obtained synchronization structure determines which mapping modules or back-ends are used to port the application to an specific platform. The first results obtained with our prototype show that even simple balancing techniques for irregular scientific applications may be easily integrated in this nested-parallel framework, to obtain efficient implementations from high-level and portable specifications. Topic: Parallel and Distributed Computing.@en