A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2007; you can also visit the original URL.
The file type is application/pdf.
Filters
On the complexity of task allocation
1997
Complexity
Preserved Fulltext
Simulated annealing is used to find the optimal allocations, which is justified by the self-similar structure of the task allocation energy landscape. ...
Depending on two application/machine-specific parameters, both a sequential and a parallel optimal allocation phase are shown to exist. ...
Given a set of parallel communicating tasks (a parallel application) and a parallel distributed memory machine, find the optimal allocation of tasks onto the parallel system. ...
doi:10.1002/(sici)1099-0526(199711/12)3:2<52::aid-cplx12>3.0.co;2-r
fatcat:sfpy4nl2dbfpbpbqdxmy4txsnu
Reliable mission deployment in vulnerable distributed systems
2013
2013 43rd Annual IEEE/IFIP Conference on Dependable Systems and Networks Workshop (DSN-W)
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
In this paper, we take a different approach, and present a solution for deploying mission tasks in a distributed computing environment in a way that minimizes a mission's exposure to vulnerabilities by ...
Recent years have seen a growing interest in missioncentric operation of large-scale distributed systems. ...
The state-space search has now reached a goal state and found a complete task allocation. ...
doi:10.1109/dsnw.2013.6615514
dblp:conf/dsn/AlbaneseJJP13
fatcat:f7m5hlrafvasrpqqgl2qcbz374
Poster
2017
Proceedings of the 23rd Annual International Conference on Mobile Computing and Networking - MobiCom '17
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
In this paper we present a graph-based resource allocation scheme for sidelink broadcast V2V communications. ...
In this research, we present a solution based on a bipartite graph, where vehicles and spectrum resources are represented by vertices whereas the edges represent the achievable rate in each resource based ...
of available subframes in which the resource allocation task can be accomplished. ...
doi:10.1145/3117811.3131260
dblp:conf/mobicom/Abanto-LeonKG17
fatcat:rg3vlqkcijh4reb74r4relxk5m
Grid Scheduling Algorithms: A Comparative Analysis
2014
International Journal of Computer Applications
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
Job scheduling is used to schedule the applications submitted by the user to appropriate resources in grid environment. It allows best match of resource for a particular job. ...
In this paper various job scheduling algorithms are compared. The job scheduling algorithms are compared and contrasted. ...
After this applying the task graph mapping to the grid system and allocate the tasks based upon resources free in the grid system. ...
doi:10.5120/18255-9351
fatcat:c3axn7jxs5fcvoh4gaqcabo25u
Multi-objective optimization in rule-based design space exploration
2014
Proceedings of the 29th ACM/IEEE international conference on Automated software engineering - ASE '14
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
In this report I present an approach (developed in collaboration with researchers from BME-MIT and Université de Montréal) to exploit multi-objective optimization techniques for rule-based design space ...
DSE is frequently used in Model Driven Systems Design (MDSD) to partially automate design processes or to dynamically reconfigure autonomous systems. ...
The design space (or state space) can be imagined as a directed graph as in many search based tasks. ...
doi:10.1145/2642937.2643005
dblp:conf/kbse/AbdeenVSNDHH14
fatcat:qmspse37b5dcnckggftfa7k4s4
Pervasive Service Bus: Smart SOA Infrastructure for Ambient Intelligence
2014
IEEE Intelligent Systems
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
The framework embeds sophisticated intelligence about users and environments, which can generate adaptive optimal service flows for user tasks. ...
The challenges are in many aspects: Interoperation: heterogeneity in network protocols and data formats adopted by different softwares and devices makes their interaction difficult. ...
Each candidate service forms a vertex in the search graph. To limit graph scale, candidates are selected with context requirement and desired quality in task model. ...
doi:10.1109/mis.2012.119
fatcat:iwn6yzbczrfc7brpteolwqnuq4
Ansor : Generating High-Performance Tensor Programs for Deep Learning
[article]
2020
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Other Versions
In addition, Ansor utilizes a task scheduler to simultaneously optimize multiple subgraphs in deep neural networks. ...
Compared with existing search strategies, Ansor explores many more optimization combinations by sampling programs from a hierarchical representation of the search space. ...
In addition to NSF CISE Expeditions Award CCF-1730628, this research is supported by gifts from Alibaba Group, Amazon Web Services, Ant Group, CapitalOne, Ericsson, Facebook, Futurewei, Google, Intel, ...
arXiv:2006.06762v4
fatcat:as6rrj2bvjcwtmkjremrrfkqhq
The Process Allocation Problem: a Survey of the Application of Graph-Theoretic and Integer Programming Approaches
1992
Journal of the Operational Research Society
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
Tsai (1985) A graph matching approach to optimal task assignment in distributed computing
systems using a minimax criterion. JEEE Trans. Comput. 34, 197-203.
. V. B. GyLys and J. A. ...
WHINSTON (1982) An optimal allocation in a distributed processing environment.
Memt Sci. 28, 839-853.
. A. GABRIELIAN and D. B. TYLER (1984) Optimal object allocation in distributed computer systems. ...
doi:10.1057/jors.1992.67
fatcat:pr44u5g2fnfh3mgqztdjzqzy7u
Communication-aware stochastic allocation and scheduling framework for conditional task graphs in multi-processor systems-on-chip
2007
Proceedings of the 7th ACM & IEEE international conference on Embedded software - EMSOFT '07
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2010; you can also visit the original URL.
The file type is application/pdf.
The problem of allocating and scheduling conditional task graphs on processors in a distributed real-time system is NP-hard. ...
The original contributions of the approach appear both in the allocation and in the scheduling part of the optimizer. ...
The problem of allocating and scheduling conditional task graphs on processors in a distributed real-time system is NP-hard. ...
doi:10.1145/1289927.1289940
dblp:conf/emsoft/DolifLRMB07
fatcat:ioplqa6fbzchzordv3goiaa5ae
Efficient and Scalable Graph Pattern Mining on GPUs
[article]
2021
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf.
Other Versions
In the multi-GPU setting, G2Miner achieves linear speedups from 1 to 8 GPUs, for various patterns and data graphs. ...
We also show that G2Miner on a V100 GPU is 48.3x and 15.2x faster than the state-of-the-art CPU-based system, Peregrine and GraphZero, on a 56-core CPU machine. ...
State-of-the-art GPM systems on CPU use pattern aware search plans that prune the search space using pattern information, and this is orders-of-magnitude faster than the pattern-oblivious search [54] ...
arXiv:2112.09761v2
fatcat:d3owab52c5eghmrgezv55xk6eu
Decentralizing Coordination in Open Vehicle Fleets for Scalable and Dynamic Task Allocation
2020
Complexity
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
We focus on multiagent system representation of open vehicle fleets where dynamically appearing vehicles are represented by software agents that should be allocated to a set of dynamically appearing tasks ...
One of the major challenges in the coordination of large, open, collaborative, and commercial vehicle fleets is dynamic task allocation. ...
funded by Spanish Ministry of Science, Innovation and Universities. ...
doi:10.1155/2020/1047369
fatcat:ctckxllr7fhxhlx2d67nqp2pkq
Reducing the Abstraction and Optimality Gaps in the Allocation and Scheduling for Variable Voltage/Frequency MPSoC Platforms
2009
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
This paper proposes a novel approach to solve the allocation and scheduling problems for variable voltage/frequency multiprocessor systems-on-chip, which minimizes overall system energy dissipation. ...
Furthermore, this paper illustrates the development-and run-time software infrastructures that assist the user in developing applications and implementing optimizer solutions. ...
This is a critical and nontrivial task, as we must guarantee that actual execution accurately matches, in time and space, the solution computed by the optimizer. ...
doi:10.1109/tcad.2009.2013536
fatcat:xzx76cbhifbobeamwessul7gqq
Design and Analysis of Multi - Heuristic Based Solution for Task Graph Scheduling Problem
2019
International Journal of Engineering and Advanced Technology
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
One of the most sought after NP-Complete problem is Task graph scheduling i.e. optimally execute the schedule of tasks on available parallel and distributed environment so as to achieve efficient utilization ...
Genetic Algorithm based task graph scheduling solution and perform a comparative study of aforementioned algorithms. ...
Issues in Task Graph Scheduling Problem Task graph scheduling in distributed systems is applied on the available resources in the network. ...
doi:10.35940/ijeat.f8680.088619
fatcat:6ayyimhotfautopalpjmfaspmu
A Hopfield neural network based task mapping method
1999
Computer Communications
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2007; you can also visit the original URL.
The file type is application/pdf.
In this paper we present a static method that uses Hopfield neural network to cluster the tasks of a parallel program for a given system. ...
This method takes into account both load balancing and communication minimization. The method has been tested on a distributed shared memory system against other three clustering methods. ...
The more the machines are allocated, the longer the time spent on searching because of the increase of searching space. ...
doi:10.1016/s0140-3664(99)00086-9
fatcat:xdkvma6zn5hqlmstq65r25coea
Decision-Making Bias in Instance Matching Model Selection
[chapter]
2015
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
The graph is first used to unify and visualize common biases in the design of existing instance matchers. ...
The hypotheses are evaluated by training 1032 neural networks on three instance matching tasks on Microsoft Azure's cloud-based platform. ...
The authors were also supported by a US National Science Foundation grant. ...
doi:10.1007/978-3-319-25007-6_23
fatcat:m37sb3luvfgtjagp6bytf6c7ue
« Previous
Showing results 1 — 15 out of 32,165 results