Robert P. Dick
Wayne Wolf
- 1.T. Yang and A. Gerasoulis, "DSC: scheduling parallel tasks on an unbounded number of processors," IEEE Trans. on Parallel and Distributed Systems, vol. 30, pp. 951-67, Sep 1994. Google Scholar
Digital Library
- 2.W. Zhao, K. Ramamrithan, and J. Stankovic, "Preemptive scheduling under time and resource constraints," IEEE Trans. on Computers, vol. 36, pp. 949-60, Aug. 1987. Google ScholarDigital Library
- 3.M. Sengupta, "ISCAS '89 benchmark information, http:llwww.cbl.ncsu.edulCBLDocsliscas89.html, Mar. 1995.Google Scholar
- 4.D. Du, J. Gu, and P. M. Pardalos, eds., Satisfiability Problem: Theory and Applications, vol. 35 of DI- MACS: Series in Discrete Mathematics and Computer Science. Providence, RI: American Mathematical Society, 1997.Google Scholar
- 5.R. P. Dick and N. K. Jha, "MOGAC: A Multiobjective Genetic Algorithm for the Hardware-Software Co-Synthesis of Distributed Embedded Systems," submitted to IEEE Trans. on Computer-Aided Design. Google ScholarDigital Library
- 6.S. Prakash and A. Parker, "SOS: Synthesis of application-specific heterogeneous multiprocessor systems,* J Parallel & Distributed Computers, vol. 16, pp. 338-351, Dec. 1992.Google ScholarCross Ref
- 7.T.-Y. Yen and W. H. Wolf, "Communication synthesis for distributed embedded systems," in Proc. Znt. Conf Computer-Aided Design, pp. 288-294, Nov. 1995. Google ScholarDigital Library
- 8.B. Dave, G. Lakshminarayana, and N. K. Jha, "COSYN: Hardware-software co-synthesis of embedded systems," in Proc. Design Automation Conf, pp. 703-708, June 1997. Google ScholarDigital Library
- 9.G. Marsaglia and A. Zaman, "Toward a universal random number generator," Statistics & Probability Letters, vol. 9, pp. 35-39, Jan. 1990.Google ScholarCross Ref
- 10.E. L. Lawler and C. U. Martel, "Scheduling periodically occurring tasks on multiple prOcessOrs,n Znformation Processing Letters, vol. 7, pp. 9-12, Feb. 1981.Google Scholar
Index Terms
- TGFF: task graphs for free
Recommendations
On the Multichromatic Number of s-Stable Kneser Graphs
For positive integers n and s, a subset Sï [n] is s-stable if sï |i-j|ï n-s for distinct i,j∈S . The s-stable r-uniform Kneser hypergraph KGrn,ks-stable is the r-uniform hypergraph that has the collection of all s-stable k-element subsets of [n] as ...
Adjacent vertex-distinguishing edge and total chromatic numbers of hypercubes
An adjacent vertex-distinguishing edge coloring of a simple graph G is a proper edge coloring of G such that incident edge sets of any two adjacent vertices are assigned different sets of colors. A total coloring of a graph G is a coloring of both the ...
Forbidden Subgraphs and Weak Locally Connected Graphs
A graph is called H-free if it has no induced subgraph isomorphic to H. A graph is called $$N^i$$Ni-locally connected if $$G[\{ x\in V(G): 1\le d_G(w, x)\le i\}]$$G[{x?V(G):1≤dG(w,x)≤i}] is connected and $$N_2$$N2-locally connected if $$G[\{uv: \{uw, vw\...
Comments