Alfredo Goldman | University of Sao Paulo (original) (raw)
Uploads
Papers by Alfredo Goldman
Mobile Agents for Telecommunication Applications, 2005
This project focuses on the implementation of a framework for mobile agents support within a grid... more This project focuses on the implementation of a framework for mobile agents support within a grid environment project, namely Int eGrade. Our goal is to present a framework where time consuming sequential tasks c an be executed using mainly the idle cycles of a network of personal workstati ons. The mobile agents may be used to encapsulate long processing applicati
Bookmarks Related papers MentionsView impact
Lecture Notes in Business Information Processing, 2011
Agile Software Development methods have caught the attention of software engineers and researcher... more Agile Software Development methods have caught the attention of software engineers and researchers worldwide, but scientific research on the subject still remains quite scarce. The aim of this study is to organize and facilitate future works on Agile methods derived from manufacturing industry. This comparative review is performed from the standpoint of using Abrahamsson et al.’s analytical perspectives: project management
Bookmarks Related papers MentionsView impact
2003 International Conference on Parallel Processing, 2003. Proceedings., 2003
Bookmarks Related papers MentionsView impact
2011 IEEE 10th International Symposium on Network Computing and Applications, 2011
ABSTRACT Nowadays there exist many networks with dynamic characteristics (e.g. MANETs, DTNs, oppo... more ABSTRACT Nowadays there exist many networks with dynamic characteristics (e.g. MANETs, DTNs, opportunistic networks, etc.). Our aim is thus to determine the necessary and sufficient connectivity conditions which allow the correct execution of some distributed algorithms on top of them. To this end, we use a framework proposed by Casteigts et al. [1] that exploits the evolving graphs theory, which models the topology of the network as well as the graph relabeling approach, which abstracts communication. In particular, we provide necessary and sufficient conditions for two important distributed problems: mutual exclusion and K-mutual exclusion.
Bookmarks Related papers MentionsView impact
2014 IEEE World Congress on Services, 2014
Bookmarks Related papers MentionsView impact
2014 IEEE International Conference on Services Computing, 2014
Bookmarks Related papers MentionsView impact
Proceedings of the 10th International Workshop on Middleware for Grids, Clouds and e-Science - MGC '12, 2012
Bookmarks Related papers MentionsView impact
International Journal of Business Process Integration and Management, 2014
Bookmarks Related papers MentionsView impact
Proceedings of the eleventh ACM SIGPLAN workshop on Erlang workshop - Erlang '12, 2012
Bookmarks Related papers MentionsView impact
2012 IEEE Ninth International Conference on Services Computing, 2012
Bookmarks Related papers MentionsView impact
2008 International Symposium on Parallel and Distributed Computing, 2008
Bookmarks Related papers MentionsView impact
Bookmarks Related papers MentionsView impact
Bookmarks Related papers MentionsView impact
Bookmarks Related papers MentionsView impact
ABSTRACT Given a hard computational problem and a pool of heuristics solving it, it is usual to h... more ABSTRACT Given a hard computational problem and a pool of heuristics solving it, it is usual to have a subset of problem instances on which no heuristic outperforms all the others when measuring their runtimes on instances. This phenomenon motivated several studies whose goal was to design frameworks, that can automatically synthesize a set of heuristics solving the same problem for generating a superior one. The success of these investigations however introduced another combinatorial problem; indeed, given a basis of parallel heuristics, there are nowadays several frameworks that can be used for a synthesis: how to choose among them? This paper proposes a solution to this question considering three frameworks for heuristics synthesis, based on algorithm portfolio scheduling in parallel and homogeneous context. For choosing among the frameworks, we comparatively analyze two aspects: the runtime required for the heuristics synthesis within each framework and the performance that can be expected from the produced heuristics. We show that it is hard to make a clear distinction between the frameworks with respect to the runtime synthesis, since the key computational problem to solve here is on all frameworks, NP-complete. On the performance criterion, we show theoretically that from a knowledge of the parallel speedup distributions of the input heuristics, we can determine the framework that will lead to the best performance. The simulations on a SAT database confirm the theoretical results and give also insights into other parallel speed-up distributions that we did not analyze. Based on these results, we propose a preliminary conclusion on how to choose among the considered frameworks.
Bookmarks Related papers MentionsView impact
Bookmarks Related papers MentionsView impact
Bookmarks Related papers MentionsView impact
Bookmarks Related papers MentionsView impact
Bookmarks Related papers MentionsView impact
ABSTRACT Agile software development is known by focusing on interaction among team members to sha... more ABSTRACT Agile software development is known by focusing on interaction among team members to share knowledge. However, little guidance is provided to encourage interaction across agile teams. Based on a preliminary conceptual model, this paper examines influencing factors, such as organizational strategy, and communication flow and channels, regarding inter-team knowledge sharing (KS) effectiveness in agile environments. We analyze the characteristics and the influence of the mentioned factors through a survey research method. Data was gathered from seven Brazilian agile software organizations. We employed statistical analysis techniques, e.g., structural equation modeling and cross-table analysis, to analyze the results. Within the surveyed companies, organizational strategy reflects on moderate commitment towards knowledge. KS practices are carried out to an acceptable standard. Extensive communication flow and the use of several channels denote that agile companies are also fostering interaction across teams. We found strong relationship between these factors and the companies' experience on agile methods. As companies continue on an agile adoption program, they growingly focus on long-term goals and consider knowledge as strategic resource. However, they still need to improve strategy alignment to all organization levels. Thus, we recommend that agile companies consider these factors when striving on this endeavor.
Bookmarks Related papers MentionsView impact
Mobile Agents for Telecommunication Applications, 2005
This project focuses on the implementation of a framework for mobile agents support within a grid... more This project focuses on the implementation of a framework for mobile agents support within a grid environment project, namely Int eGrade. Our goal is to present a framework where time consuming sequential tasks c an be executed using mainly the idle cycles of a network of personal workstati ons. The mobile agents may be used to encapsulate long processing applicati
Bookmarks Related papers MentionsView impact
Lecture Notes in Business Information Processing, 2011
Agile Software Development methods have caught the attention of software engineers and researcher... more Agile Software Development methods have caught the attention of software engineers and researchers worldwide, but scientific research on the subject still remains quite scarce. The aim of this study is to organize and facilitate future works on Agile methods derived from manufacturing industry. This comparative review is performed from the standpoint of using Abrahamsson et al.’s analytical perspectives: project management
Bookmarks Related papers MentionsView impact
2003 International Conference on Parallel Processing, 2003. Proceedings., 2003
Bookmarks Related papers MentionsView impact
2011 IEEE 10th International Symposium on Network Computing and Applications, 2011
ABSTRACT Nowadays there exist many networks with dynamic characteristics (e.g. MANETs, DTNs, oppo... more ABSTRACT Nowadays there exist many networks with dynamic characteristics (e.g. MANETs, DTNs, opportunistic networks, etc.). Our aim is thus to determine the necessary and sufficient connectivity conditions which allow the correct execution of some distributed algorithms on top of them. To this end, we use a framework proposed by Casteigts et al. [1] that exploits the evolving graphs theory, which models the topology of the network as well as the graph relabeling approach, which abstracts communication. In particular, we provide necessary and sufficient conditions for two important distributed problems: mutual exclusion and K-mutual exclusion.
Bookmarks Related papers MentionsView impact
2014 IEEE World Congress on Services, 2014
Bookmarks Related papers MentionsView impact
2014 IEEE International Conference on Services Computing, 2014
Bookmarks Related papers MentionsView impact
Proceedings of the 10th International Workshop on Middleware for Grids, Clouds and e-Science - MGC '12, 2012
Bookmarks Related papers MentionsView impact
International Journal of Business Process Integration and Management, 2014
Bookmarks Related papers MentionsView impact
Proceedings of the eleventh ACM SIGPLAN workshop on Erlang workshop - Erlang '12, 2012
Bookmarks Related papers MentionsView impact
2012 IEEE Ninth International Conference on Services Computing, 2012
Bookmarks Related papers MentionsView impact
2008 International Symposium on Parallel and Distributed Computing, 2008
Bookmarks Related papers MentionsView impact
Bookmarks Related papers MentionsView impact
Bookmarks Related papers MentionsView impact
Bookmarks Related papers MentionsView impact
ABSTRACT Given a hard computational problem and a pool of heuristics solving it, it is usual to h... more ABSTRACT Given a hard computational problem and a pool of heuristics solving it, it is usual to have a subset of problem instances on which no heuristic outperforms all the others when measuring their runtimes on instances. This phenomenon motivated several studies whose goal was to design frameworks, that can automatically synthesize a set of heuristics solving the same problem for generating a superior one. The success of these investigations however introduced another combinatorial problem; indeed, given a basis of parallel heuristics, there are nowadays several frameworks that can be used for a synthesis: how to choose among them? This paper proposes a solution to this question considering three frameworks for heuristics synthesis, based on algorithm portfolio scheduling in parallel and homogeneous context. For choosing among the frameworks, we comparatively analyze two aspects: the runtime required for the heuristics synthesis within each framework and the performance that can be expected from the produced heuristics. We show that it is hard to make a clear distinction between the frameworks with respect to the runtime synthesis, since the key computational problem to solve here is on all frameworks, NP-complete. On the performance criterion, we show theoretically that from a knowledge of the parallel speedup distributions of the input heuristics, we can determine the framework that will lead to the best performance. The simulations on a SAT database confirm the theoretical results and give also insights into other parallel speed-up distributions that we did not analyze. Based on these results, we propose a preliminary conclusion on how to choose among the considered frameworks.
Bookmarks Related papers MentionsView impact
Bookmarks Related papers MentionsView impact
Bookmarks Related papers MentionsView impact
Bookmarks Related papers MentionsView impact
Bookmarks Related papers MentionsView impact
ABSTRACT Agile software development is known by focusing on interaction among team members to sha... more ABSTRACT Agile software development is known by focusing on interaction among team members to share knowledge. However, little guidance is provided to encourage interaction across agile teams. Based on a preliminary conceptual model, this paper examines influencing factors, such as organizational strategy, and communication flow and channels, regarding inter-team knowledge sharing (KS) effectiveness in agile environments. We analyze the characteristics and the influence of the mentioned factors through a survey research method. Data was gathered from seven Brazilian agile software organizations. We employed statistical analysis techniques, e.g., structural equation modeling and cross-table analysis, to analyze the results. Within the surveyed companies, organizational strategy reflects on moderate commitment towards knowledge. KS practices are carried out to an acceptable standard. Extensive communication flow and the use of several channels denote that agile companies are also fostering interaction across teams. We found strong relationship between these factors and the companies' experience on agile methods. As companies continue on an agile adoption program, they growingly focus on long-term goals and consider knowledge as strategic resource. However, they still need to improve strategy alignment to all organization levels. Thus, we recommend that agile companies consider these factors when striving on this endeavor.
Bookmarks Related papers MentionsView impact